Nonparametric weighted stochastic block models

Abstract

We present a Bayesian formulation of weighted stochastic block models that can be used to infer the large-scale modular structure of weighted networks, including their hierarchical organization. Our method is nonparametric, and thus does not require the prior knowledge of the number of groups or other dimensions of the model, which are instead inferred from data. We give a comprehensive treatment of different kinds of edge weights (i.e. continuous or discrete, signed or unsigned, bounded or unbounded), as well as arbitrary weight transformations, and describe an unsupervised model selection approach to choose the best network description. We illustrate the application of our method to a variety of empirical weighted networks, such as global migrations, voting patterns in congress, and neural connections in the human brain.

19 pages, 11 figures. Code is freely available as part of graph-tool at https://graph-tool.skewed.de . See also the HOWTO at https://graph-tool.skewed.de/static/doc/demos/inference/inference.html

References in corpus (11)

• Resolution limit in community detection
• Stochastic blockmodels and community structure in networks
• Community detection in networks: A user guide
• Missing and spurious interactions and the reconstruction of complex networks
• Robust Detection of Dynamic Community Structure in Networks
• Parsimonious module inference in large networks
• Learning Latent Block Structure in Weighted Networks
• When are networks truly modular?
• Model selection and hypothesis testing for large-scale network models with overlapping groups
• Community Detection in the Labelled Stochastic Block Model
• Active Learning for Hidden Attributes in Networks