Mapping flows on weighted and directed networks with incomplete observations
arXiv:2106.14798 · doi:10.1093/comnet/cnab044
Abstract
Detecting significant community structure in networks with incomplete observations is challenging because the evidence for specific solutions fades away with missing data. For example, recent research shows that flow-based community detection methods can highlight spurious communities in sparse undirected and unweighted networks with missing links. Current Bayesian approaches developed to overcome this problem do not work for incomplete observations in weighted and directed networks that describe network flows. To address this gap, we extend the idea behind the Bayesian estimate of the map equation for unweighted and undirected networks to enable more robust community detection in weighted and directed networks. We derive a weighted and directed prior network that can incorporate metadata information and show how an efficient implementation in the community-detection method Infomap provides more reliable communities even with a significant fraction of data missing.
References in corpus (20)
- Maps of random walks on complex networks reveal community structure
- The architecture of complex weighted networks
- Analysis of weighted networks
- Finding statistically significant communities in networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- Mapping change in large networks
- Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
- Community Detection in Networks with Node Attributes
- The ground truth about metadata and community detection in networks
- Structure and inference in annotated networks
- Community detection in networks: Structural communities versus ground truth
- Network structure from rich but noisy data
- Evaluating Overfit and Underfit in Models of Network Community Structure
- Stacking Models for Nearly Optimal Link Prediction in Complex Networks
- Statistical significance of communities in networks
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- Ranking and clustering of nodes in networks with smart teleportation
- Structural inference for uncertain networks
- A Map Equation with Metadata: Varying the Role of Attributes in Community Detection
- Mapping flows on sparse networks with missing links