Modeling sparsity in count-weighted networks
Andressa Cerqueira, Laila L. S. Costa

TL;DR
This paper introduces a probabilistic model for weighted networks that controls sparsity and includes degree corrections, along with a community detection method using VEM, demonstrated on simulated data and the Brazilian airport network.
Contribution
It presents a novel probabilistic model for weighted networks with sparsity control and degree correction, plus a VEM-based community detection method.
Findings
Effective community detection on simulated networks
Insights into Brazilian airport network community changes during COVID-19
Model handles weighted, sparse networks with degree corrections
Abstract
Community detection methods have been extensively studied to recover communities structures in network data. While many models and methods focus on binary data, real-world networks also present the strength of connections, which could be considered in the network analysis. We propose a probabilistic model for generating weighted networks that allows us to control network sparsity and incorporates degree corrections for each node. We propose a community detection method based on the Variational Expectation-Maximization (VEM) algorithm. We show that the proposed method works well in practice for simulated networks. We analyze the Brazilian airport network to compare the community structures before and during the COVID-19 pandemic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Criteria Decision Making · Bayesian Modeling and Causal Inference · Graph theory and applications
