DYMOND: DYnamic MOtif-NoDes Network Generative Model
August 01, 2023 ยท Declared Dead ยท ๐ The Web Conference
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Giselle Zeno, Timothy La Fond, Jennifer Neville
arXiv ID
2308.00770
Category
cs.SI: Social & Info Networks
Cross-listed
cs.LG
Citations
36
Venue
The Web Conference
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Social & Info Networks
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
node2vec: Scalable Feature Learning for Networks
R.I.P.
๐ป
Ghosted
Cooperative Game Theory Approaches for Network Partitioning
R.I.P.
๐ป
Ghosted
From Louvain to Leiden: guaranteeing well-connected communities
R.I.P.
๐ป
Ghosted
Fake News Detection on Social Media: A Data Mining Perspective
R.I.P.
๐ป
Ghosted
Heterogeneous Graph Attention Network
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted