A generative model for temporal networks that jointly controls community evolution and dynamic node sets and is used as a benchmark to study the impact of the rate at which nodes join/leave the network on the performance of dynamic community detection algorithms.
Abstract
This paper introduces a generative model for temporal networks that jointly controls community evolution and dynamic node sets. The model represents community structure as a sequence of partitions and uses a genetic search guided by a similarity measure based on mutual information to regulate changes between snapshots. This allows explicit control of community evolution including splits and merges while handling node additions and removals. Temporal edges are then generated using intra- and inter-community probabilities derived from data or theoretical bounds to ensure connectivity. Simulation experiments on real-world datasets demonstrate the ability of the generative model to model the evolution of real dynamic communities. The model is used as a benchmark to study the impact of the rate at which nodes join/leave the network on the performance of dynamic community detection algorithms.
By specifying a stochastically evolving hidden Markov network model, this work addresses two important directions for further investigation identified by Chang et al. (2022): robustness to non-identical network replicates, and efficient aggregation of multiple available network snapshots.
A novel theoretical model, namely the multiway autoregressive (MARS) model, which characterizes multiple evolutionary paths by capturing dependencies within and across two core factors underlying diverse evolutionary mechanisms is proposed, which develops a general DGNN framework, a multiway autoregressive network (MAN...
Ping He, Xiao-hua Xu· IEEE Transactions on Neural...· 0 citations
This work formulate dynamic community detection over observed node-time instances, where each node-time instance in the temporal interaction stream is assigned a cluster label and proposes a diffusion-guided contrastive learning framework that uses a local temporal diffusion affinity matrix to construct positive and ne...
Pei-Jie Zhong, Raul J. Mondragón, Richard G. Clegg· 0 citations
The Hierarchical Stochastic Block Model is proposed, a generalization of the Stochastic Block Model to the setting of replicated networks, and uses a Hierarchical Pitman-Yor prior for the block allocation vector of each graph, and allows different networks to share the same latent blocks.
Marco Battiston, Clement Lee· Statistics and computing· 0 citations
This work proposes a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs that is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics.
Mohammad Ostadmohammadi, S. Kazemi, H. R. Rabiee· arXiv.org· 0 citations
The framework gives a nonparametric baseline for dynamic network analysis with explicit convergence guarantees and establishes nonparametric convergence rates in both block-model and Holder-smooth regimes.
Charles Dufour, S. Olhede· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.