Statistical clustering of temporal networks through a dynamic stochastic block model

By Catherine Matias, Vincent Miele. 2015

351 citations recorded by the source corpus.

Statistical node clustering in discrete time dynamic networks is an emerging field that raises many challenges. Here, we explore statistical properties and frequentist inference in a model that combines a stochastic block model for its static part with independent Markov chains for the evolution of the nodes groups through time. We model binary data as well as weighted dynamic random graphs (with discrete or continuous edges values). Our approach, motivated by the importance of controlling for label switching issues across the different time steps, focuses on detecting groups characterized by a stable within‐group connectivity behaviour. We study identifiability of the model parameters and propose an inference procedure based on a variational expectation–maximization algorithm as well as a model selection criterion to select the number of groups. We carefully discuss our initialization strategy which plays an important role in the method and we compare our procedure with existing procedures on synthetic data sets. We also illustrate our approach on dynamic contact networks: one of encounters between high school students and two others on animal interactions. An implementation of the method is available as an R package called dynsbm.

Subfields: Artificial Intelligence, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/2e7e41ad8adb797ea4702f76ac02dc33cb400452

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Vincent Miele
  2. Catherine Matias
  3. Stéphane Robin
  4. Stéphane Dray

In Statistical and Nonlinear Physics

  1. Catherine Matias
  2. Vincent Miele
  3. Stéphane Robin
  4. Stéphane Dray

Citations in the corpus