Variational inference for estimating dynamic stochastic block models through an evolutionary algorithm

Abstract Dynamic temporal networks are important structures to capture node dependencies and their evolution over time. The dynamic stochastic block model, commonly used with longitudinal network data, is estimated maximizing the likelihood function through the variational expectation-maximization (VEM) algorithm. However, maximization is challenging due to the presence of multiple local maxima. In this paper, we first conduct a simulation study to assess the performance of six different parameter initialization strategies. Second, we introduce a novel specification of the VEM through a genetic algorithm, enabling a more comprehensive exploration of the parameter space. Results from both simulations and historical data on infectious disease transmission highlight the advantages of this approach in overcoming convergence to local maxima and improving node clustering in temporal network data.

Authors

Institutions

Publication Details

Journal
Advances in Data Analysis and Classification
Published
2025-05-23
DOI
https://doi.org/10.1007/s11634-025-00634-9
Citations
1
Primary Topic
Bayesian Methods and Mixture Models
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variational inference for estimating dynamic stochastic block models through an evolutionary algorithm

Luca Brusa, Fulvia Pennoni
1 citations
Advances in Data Analysis and Classification
Bayesian Methods and Mixture Models
2.48
article

Variational inference for estimating dynamic stochastic block models through an evolutionary algorithm

Luca Brusa, Fulvia Pennoni
article en
1 citations

Abstract

Abstract Dynamic temporal networks are important structures to capture node dependencies and their evolution over time. The dynamic stochastic block model, commonly used with longitudinal network data, is estimated maximizing the likelihood function through the variational expectation-maximization (VEM) algorithm. However, maximization is challenging due to the presence of multiple local maxima. In this paper, we first conduct a simulation study to assess the performance of six different parameter initialization strategies. Second, we introduce a novel specification of the VEM through a genetic algorithm, enabling a more comprehensive exploration of the parameter space. Results from both simulations and historical data on infectious disease transmission highlight the advantages of this approach in overcoming convergence to local maxima and improving node clustering in temporal network data.

Advances in Data Analysis and ClassificationVol. 19(2)
University of Milano-Bicocca (IT)
European Commission, Università degli Studi di Milano-Bicocca, Ministero dell'Università e della Ricerca
Openalex Percentile: Top 10%
Bayesian Methods and Mixture Models
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.