DYMOND: DYnamic MOtif-NoDes Network Generative Model
Giselle Zeno, Timothy La Fond, Jennifer Neville
Abstract
Motifs, which have been established as building blocks for network structure, move beyond pair-wise connections to capture longer-range correlations in connections and activity. In spite of this, there are few generative graph models that consider higher-order network structures and even fewer that focus on using motifs in models of dynamic graphs. Most existing generative models for temporal graphs strictly grow the networks via edge addition, and the models are evaluated using static graph structure metrics—which do not adequately capture the temporal behavior of the network. To address these issues, in this work we propose DYnamic MOtif-NoDes (DYMOND)—a generative model that considers (i) the dynamic changes in overall graph structure using temporal motif activity and (ii) the roles nodes play in motifs (e.g., one node plays the hub role in a wedge, while the remaining two act as spokes). We compare DYMOND to three dynamic graph generative model baselines on real-world networks and show that DYMOND performs better at generating graph structure and node behavior similar to the observed network. We also propose a new methodology to adapt graph structure metrics to better evaluate the temporal aspect of the network. These metrics take into account the changes in overall graph structure and the individual nodes’ behavior over time.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c6798cbd-8ebe-4b1b-b313-fa2823d44c3fCited by top-tier papers9
- TIGGER: Scalable Generative Modelling for Temporal Interaction GraphsShubham Gupta, Sahil Manchanda, Srikanta Bedathur, Sayan RanuAAAI 2022 · 24 citations
- Towards Event Prediction in Temporal GraphsWenfei Fan, Ruochun Jin, Ping Lu, Chao Tian et al.VLDB 2022 · 19 citations
- HOG-Diff: Higher-Order Guided Diffusion for Graph GenerationYiming Huang, Tolga BirdalICLR 2026 · 9 citations
- Efficient Dynamic Attributed Graph GenerationFan Li, Xiaoyang Wang, Dawei Cheng, Cong Chen et al.ICDE 2025 · 5 citations
- GDGB: A Benchmark for Generative Dynamic Text-Attributed Graph LearningJie Peng, Jiarui Ji, Runlin Lei, Zhewei Wei et al.ICLR 2026 · 4 citations
Builds on1
Related papers
- Using Motif Transitions for Temporal Graph GenerationPenghang Liu, Ahmet Erdem SariyüceKDD 2023 · 11 citations
- MoDiff - Graph Generation with Motif-aware Diffusion ModelYuwei Xu, Chenhao MaKDD 2025
- TG-GAN: Continuous-time Temporal Graph Deep Generative Models with Time-Validity ConstraintsLiming Zhang, Liang Zhao, Shan Qin, Dieter Pfoser et al.WWW 2021 · 25 citations
- Streaming Graph Neural NetworksYao Ma, Ziyi Guo, Zhaochun Ren, Jiliang Tang et al.SIGIR 2020 · 210 citations
- A Deep Probabilistic Framework for Continuous Time Dynamic Graph GenerationRyien Hosseini, Filippo Simini, Venkatram Vishwanath, Henry HoffmannAAAI 2025 · 3 citations
