Latent Space Approaches to Community Detection in Dynamic Networks

Abstract

Embedding dyadic data into a latent space has long been a popular approach to modeling networks of all kinds. While clustering has been done using this approach for static networks, this paper gives two methods of community detection within dynamic network data, building upon the distance and projection models previously proposed in the literature. Our proposed approaches capture the time-varying aspect of the data, can model directed or undirected edges, inherently incorporate transitivity and account for each actor's individual propensity to form edges. We provide Bayesian estimation algorithms, and apply these methods to a ranked dynamic friendship network and world export/import data.

References in corpus (8)

• Finding community structure in very large networks
• Latent Space Models for Dynamic Networks
• A state-space mixed membership blockmodel for dynamic network tomography
• Nonparametric Bayes dynamic modeling of relational data
• Latent Space Models for Dynamic Networks with Weighted Edges
• Latent Space Approaches to Community Detection in Dynamic Networks
• Exponential-Family Random Graph Models for Rank-Order Relational Data
• Analysis of the Formation of the Structure of Social Networks using Latent Space Models for Ranked Dynamic Networks

Cited by in corpus (4)

• Latent Space Approaches to Community Detection in Dynamic Networks
• Identifying overlapping terrorist cells from the Noordin Top actor-event network
• Variational Inference for the Latent Shrinkage Position Model
• Dynamic degree-corrected blockmodels for social networks: a nonparametric approach