Pith. sign in

REVIEW 1 cited by

Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.07496 v2 pith:FQ6PRH45 submitted 2020-05-13 cs.SI cs.LGstat.ML

classification cs.SIcs.LGstat.ML
keywords dynamicnetworksnetworkgraphneuralterminologyfieldsmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Dynamic networks are used in a wide range of fields, including social network analysis, recommender systems, and epidemiology. Representing complex networks as structures changing over time allow network models to leverage not only structural but also temporal patterns. However, as dynamic network literature stems from diverse fields and makes use of inconsistent terminology, it is challenging to navigate. Meanwhile, graph neural networks (GNNs) have gained a lot of attention in recent years for their ability to perform well on a range of network science tasks, such as link prediction and node classification. Despite the popularity of graph neural networks and the proven benefits of dynamic network models, there has been little focus on graph neural networks for dynamic networks. To address the challenges resulting from the fact that this research crosses diverse fields as well as to survey dynamic graph neural networks, this work is split into two main parts. First, to address the ambiguity of the dynamic network terminology we establish a foundation of dynamic networks with consistent, detailed terminology and notation. Second, we present a comprehensive survey of dynamic graph neural network models using the proposed terminology

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ReInc: Scaling Training of Dynamic Graph Neural Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    ReInc trains dynamic GNNs on large graphs up to 12.8x to 17.7x faster than DynaGraph and ESDGNN by reusing cached aggregations, incremental delta-based updates, and a communication-free snapshot placement.

Pith tools