Approaches to blockmodeling dynamic networks

Blockmodeling refers to a variety of statistical methods for reducing and simplifying large and complex networks. While methods for blockmodeling networks observed at one time point are well established, it is only recently that researchers have proposed several methods for analysing dynamic networks (i.e., networks observed at multiple time points). The considered approaches are based on k-means or stochastic blockmodeling, with different ways being used to model time dependency among time points. Their novelty means they have yet to be extensively compared and evaluated and the paper therefore aims to compare and evaluate them using Monte Carlo simulations. Different network characteristics are considered, including whether tie formation is random or governed by local network mechanisms. The results show the Dynamic Stochastic Blockmodel (Matias and Miele 2017) performs best if the blockmodel does not changeotherwise, the Stochastic Blockmodel for Multipartite Networks (Bar-Hen et al. 2020) does