Modeling sparsity in count-weighted networks with stochastic block models

Abstract Community detection methods have been extensively studied to recover community structures in network data. While many existing approaches focus on binary networks, real-world networks often exhibit weighted connections, which provide additional information about the strength of interactions. However, most methods do not simultaneously account for both network sparsity and heterogeneous node degrees, which are crucial for accurately modeling real-world networks. To address this, we propose a probabilistic model for generating weighted networks that explicitly incorporates sparsity control and degree corrections. We develop a community detection method based on the likelihood using a Variational Expectation-Maximization algorithm, allowing efficient estimation of both community memberships and model parameters. Through simulations, we show that our approach accurately recovers community structures. We further analyze the Brazilian airport network to compare the community structures before and during the COVID-19 pandemic.

Authors

Institutions

Publication Details

Journal
Journal of Complex Networks
Published
2025-10-09
DOI
https://doi.org/10.1093/comnet/cnaf041
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modeling sparsity in count-weighted networks with stochastic block models

Andressa Cerqueira, Luís Costa
Journal of Complex Networks
Complex Network Analysis Techniques
article

Modeling sparsity in count-weighted networks with stochastic block models

Andressa Cerqueira, Luís Costa
article en

Abstract

Abstract Community detection methods have been extensively studied to recover community structures in network data. While many existing approaches focus on binary networks, real-world networks often exhibit weighted connections, which provide additional information about the strength of interactions. However, most methods do not simultaneously account for both network sparsity and heterogeneous node degrees, which are crucial for accurately modeling real-world networks. To address this, we propose a probabilistic model for generating weighted networks that explicitly incorporates sparsity control and degree corrections. We develop a community detection method based on the likelihood using a Variational Expectation-Maximization algorithm, allowing efficient estimation of both community memberships and model parameters. Through simulations, we show that our approach accurately recovers community structures. We further analyze the Brazilian airport network to compare the community structures before and during the COVID-19 pandemic.

Journal of Complex NetworksVol. 13(6)
Universidade Federal de São Carlos (BR)
Openalex Percentile: Top 74%
Complex Network Analysis Techniques
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.