Exploring the structure and function of temporal networks with dynamic graphlets
Not on the map. Why?
Abstract (arXiv)
With the growing amount of available temporal real-world network data, an important question is how to efficiently study these data. One can simply model a temporal network as either a single aggregate static network, or as a series of time-specific snapshots, each of which is an aggregate static network over the corresponding time window. The advantage of modeling the temporal data in these two ways is that one can use existing well established methods for static network analysis to study the resulting aggregate network(s). Here, we develop a novel approach for studying temporal network data more explicitly. We base our methodology on the well established notion of graphlets (subgraphs), which have been successfully used in numerous contexts in static network research. Here, we take the notion of static graphlets to the next level and develop new theory needed to allow for graphlet-based analysis of temporal networks. Our new notion of dynamic graphlets is quite different than existing approaches for dynamic network analysis that are based on temporal motifs (statistically significant subgraphs). Namely, these approaches suffer from many limitations. For example, they can only deal with subgraph structures of limited complexity. Also, their major drawback is that their results heavily depend on the choice of a null network model that is required to evaluate the significance of a subgraph. However, choosing an appropriate null network model is a non-trivial task. Our dynamic graphlet approach overcomes the limitations of the existing temporal motif-based approaches. At the same time, when we thoroughly evaluate the ability of our new approach to characterize the structure and function of an entire temporal network or of individual nodes, we find that the dynamic graphlet approach outperforms the static graphlet approach, which indicates that accounting for temporal information helps.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Dec 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 5; 2024: 1; 2025: 2; 2026: 1.
10 papers.
- 2023TempME: Towards the Explainability of Temporal Graph Neural Networks via Motif Discoverycited by 27
- 2023DYMOND: DYnamic MOtif-NoDes Network Generative Modelcited by 10
- 2023Using Motif Transitions for Temporal Graph Generationcited by 7
- 2021odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networkscited by 3
- 2023Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platformscited by 3
- 2023A Network Science perspective of Graph Convolutional Networks: A surveycited by 1
- 2024Simplifying complex machine learning by linearly separable network embedding spacescited by 1
- 2025Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embeddingcited by 0
- 2025Efficient Approximate Temporal Triangle Counting in Streaming with Predictionscited by 0
- 2026Traditional machine learning vs. deep learning from dynamic graph representations of proteins' 3D folds in the task of protein structure classificationcited by 0
- 2026Traditional machine learning vs. deep learning from dynamic graph representations of proteins' 3D folds in the task of protein structure classification28 May 2026
- 2025Efficient Approximate Temporal Triangle Counting in Streaming with Predictions16 Jun 2025
- 2025Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding14 Mar 2025
- 2024Simplifying complex machine learning by linearly separable network embedding spaces2 Oct 2024
- 2023TempME: Towards the Explainability of Temporal Graph Neural Networks via Motif Discovery30 Oct 2023
- 2023DYMOND: DYnamic MOtif-NoDes Network Generative Model1 Aug 2023
- 2023Using Motif Transitions for Temporal Graph Generation19 Jun 2023
- 2023Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms18 Jan 2023
- 2023A Network Science perspective of Graph Convolutional Networks: A survey12 Jan 2023
- 2021odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks19 Aug 2021