Stochastic blockmodels and community structure in networks

  title={Stochastic blockmodels and community structure in networks},
  author={Brian Karrer and Mark E. J. Newman},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={83 1 Pt 2},
  • B. KarrerM. Newman
  • Published 23 August 2010
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Stochastic blockmodels have been proposed as a tool for detecting community structure in networks as well as for generating synthetic networks for use as benchmarks. Most blockmodels, however, ignore variation in vertex degree, making them unsuitable for applications to real-world networks, which typically display broad degree distributions that can significantly affect the results. Here we demonstrate how the generalization of blockmodels to incorporate this missing element leads to an… 

Figures from this paper

Hurdle Blockmodels for Sparse Network Modeling

This article proposes hurdle versions of ordinary and degree corrected stochastic blockmodels to account for community structure and degree heterogeneity in sparse networks and uses simulation to ensure parameter estimation is consistent and precise, and proposes the use of likelihood ratio-type tests for model selection.

Community detection for directed weighted networks

A Directed Distribution-Free model is introduced by releasing ScBM’s distribution restriction and an extension of the proposed model is built by considering variation of node degree, which does not require a specific distribution on generating elements of adjacency matrix.

Mixed-Membership Stochastic Block Models for Weighted Networks

These models, that represent the first weighted mixedmembership stochastic block models to the authors' knowledge, can be deployed on large networks comprising millions of edges and solve the weight prediction problem that consists in predicting weights on links in weighted networks.

Modeling with Node Degree Preservation Can Accurately Find Communities

This work adopted a random-graph null model to faithfully capture community structures by preserving in the model the expected node degrees, and learned using nonnegative matrix factorization is more accurate and robust in representing community structures than the existing methods.

Scalable MCMC in Degree Corrected Stochastic Block Model

  • Soumyasundar PalM. Coates
  • Computer Science
    ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2019
A version of a degree corrected stochastic block model is proposed and an MCMC based inference algorithm is presented to solve an inference problem based on a generative model of the network.

Network Cross-Validation for Determining the Number of Communities in Network Data

It is proved that the probability of under-selection vanishes as the number of nodes increases, under mild conditions satisfied by a wide range of popular community recovery algorithms.

Adapting the Stochastic Block Model to Edge-Weighted Networks

This model will enable the recovery of latent structure in a broader range of network data than was previously possible and introduce a variational algorithm that efficiently approximates the model's posterior distribution for dense graphs.

Community Detection in Bipartite Networks with Stochastic Blockmodels

This work introduces a Bayesian nonparametric formulation of the stochastic block model and a corresponding algorithm to efficiently find communities in bipartite networks which parsimoniously chooses the number of communities, and expands the understanding of the complicated optimization landscape associated with community detection tasks.

Block dense weighted networks with augmented degree correction

A new framework for generating and estimating dense weighted networks with potentially different connectivity patterns across different communities, relying on a particular class of functions which map individual node characteristics to the edges connecting those nodes, allowing for flexibility while requiring a small number of parameters relative to the number of edges.



Social Networks

4 Figure 9.1: This graph shows the social relations between the members of a karate club, studied by anthropologist Wayne Zachary in the 1970s. Two people (nodes) stand out, the instructor and the

Foundations and Trends ® in Machine Learning > Vol 7 > Issue 4-5 Ordering Info About Us Alerts Contact Help Log in Adaptation , Learning , and Optimization over Networks

Subjects Adaptive control and signal processing, Behavioral, cognitive and neural learning, Data mining, Graphical models, Online learning, Optimization, Statistical learning theory, Computational

Journal of Classification

This book offers papers in the field of classification, numerical taxonomy, multidimensional scaling and other ordination techniques, clustering, tree structures and other network models, and extends to statistics, psychology, biology, information retrieval, anthropology, archeology and more.

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003

Alongside traditional KDD topics like classification, clustering, frequent sets, scalability, and temporal data, there are also papers in rapidly growing areas like graph and relational mining, data streams, semi-structured data, and privacy.


This article describes the process and findings of a community study that was part of a task force to improve educational experiences for new English learners, particularly the large number of


  • Natl. Acad. Sci. USA 104, 7327
  • 2007


  • Rev. E 78, 046110
  • 2008


  • Natl. Acad. Sci. USA 106, 21068
  • 2009

Journal Of The American Statistical Association V-28