DYMOND: DYnamic MOtif-NoDes Network Generative Model

被引:18
作者
Zeno, Giselle [1 ]
La Fond, Timothy [2 ]
Neville, Jennifer [1 ]
机构
[1] Purdue Univ, W Lafayette, IN 47907 USA
[2] Lawrence Livermore Natl Lab, Livermore, CA 94550 USA
来源
PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021) | 2021年
关键词
Dynamic Networks; Temporal Graphs; Motifs; Network Evolution; GRAPHS;
D O I
10.1145/3442381.3450102
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:718 / 729
页数:12
相关论文
共 34 条
[1]  
[Anonymous], 1959, Publ. Math. Debr.
[2]   Simplicial closure and higher-order link prediction [J].
Benson, Austin R. ;
Abebe, Rediet ;
Schaub, Michael T. ;
Jadbabaie, Ali ;
Kleinberg, Jon .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2018, 115 (48) :E11221-E11230
[3]   Triadic closure as a basic generating mechanism of communities in complex networks [J].
Bianconi, Ginestra ;
Darst, Richard K. ;
Iacovacci, Jacopo ;
Fortunato, Santo .
PHYSICAL REVIEW E, 2014, 90 (04)
[4]   Graph mining: Laws, generators, and algorithms [J].
Chakrabarti, Deepayan ;
Faloutsos, Christos .
ACM COMPUTING SURVEYS, 2006, 38 (01) :A1-A69
[5]   The average distances in random graphs with given expected degrees [J].
Chung, F ;
Lu, LY .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (25) :15879-15882
[6]   Modern temporal network theory: a colloquium [J].
Holme, Petter .
EUROPEAN PHYSICAL JOURNAL B, 2015, 88 (09)
[8]   Exploring the structure and function of temporal networks with dynamic graphlets [J].
Hulovatyy, Y. ;
Chen, H. ;
Milenkovic, T. .
BIOINFORMATICS, 2015, 31 (12) :171-180
[9]   Random graph models for directed acyclic networks [J].
Karrer, Brian ;
Newman, M. E. J. .
PHYSICAL REVIEW E, 2009, 80 (04)
[10]  
Klimt B, 2004, LECT NOTES COMPUT SC, V3201, P217