IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0349685.html

Evolving graph attention networks for dynamic link prediction

Author

Listed:
  • Yucai Jiang
  • Rongying Shan
  • Gang Fu
  • Zhuolin Li
  • Jingjing Sun
  • Zhongyun Bao
  • Feifei Wei

Abstract

Graph neural networks (GNNs), which learn node representations via aggregating their neighbors, have shown superior performance and become the de facto efficient toolkit for analyzing and learning from data with structured properties. However, most existing GNNs are designed for static graphs and assume fixed graph structures and node sets. In many real-world applications, graphs evolve continuously over time—with nodes and edges appearing or disappearing—rendering static models insufficient for capturing these temporal dynamics. In this paper, we propose Evolving Graph Attention Networks (EGAT), a novel framework for dynamic graph representation learning. Specifically, EGAT leverages the anisotropic attention mechanism of Graph Attention Networks (GATs) to capture complex inter-node relationships. Crucially, the multi-head attention weights of the GAT are evolved over time via a recurrent neural network (RNN), enabling the model to adaptively adjust the importance of different neighbors as the graph topology and relational dynamics change. This weight-evolving paradigm couples the anisotropic attention mechanism of GATs with a recurrent subnetwork, enabling the joint modeling of topological evolution and temporal relational dynamics. Extensive experiments on benchmark datasets demonstrate that the proposed model consistently outperforms state-of-the-art baselines.

Suggested Citation

  • Yucai Jiang & Rongying Shan & Gang Fu & Zhuolin Li & Jingjing Sun & Zhongyun Bao & Feifei Wei, 2026. "Evolving graph attention networks for dynamic link prediction," PLOS ONE, Public Library of Science, vol. 21(6), pages 1-13, June.
  • Handle: RePEc:plo:pone00:0349685
    DOI: 10.1371/journal.pone.0349685
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0349685
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0349685&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0349685?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0349685. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.