Adapting the Stochastic Block Model to Edge-Weighted Networks

We generalize the stochastic block model to the important case in which edges are annotated with weights drawn from an exponential family distribution. This generalization introduces several technical difficulties for model estimation, which we solve using a Bayesian approach. We introduce a variational algorithm that efficiently approximates the model's posterior distribution for dense graphs. In specific numerical experiments on edge-weighted networks, this weighted stochastic block model outperforms the common approach of first applying a single threshold to all weights and then applying the classic stochastic block model, which can obscure latent block structure in networks. This model will enable the recovery of latent structure in a broader range of network data than was previously possible.

[1]  M. Meilă.  Comparing clusterings---an information based distance , 2007 .

[2]  Tiago P Peixoto,et al.  Parsimonious module inference in large networks. , 2012, Physical review letters.

[3]  J. Bader,et al.  Dynamic Networks from Hierarchical Bayesian Graph Clustering , 2010, PloS one.

[4]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[5]  Mark E. J. Newman,et al.  An efficient and principled method for detecting communities in networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[7]  Cristopher Moore,et al.  Phase transition in the detection of modules in sparse networks , 2011, Physical review letters.

[8]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Yuchung J. Wang,et al.  Stochastic Blockmodels for Directed Graphs , 1987 .

[10]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[11]  Franck Picard,et al.  A mixture model for random graphs , 2008, Stat. Comput..

[12]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[13]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[14]  Chris H Wiggins,et al.  Bayesian approach to network modularity. , 2007, Physical review letters.

[15]  Andrew C. Thomas,et al.  Valued Ties Tell Fewer Lies: Why Not To Dichotomize Network Edges With Thresholds , 2011, ArXiv.

[16]  St'ephane Robin,et al.  Uncovering latent structure in valued graphs: A variational approach , 2010, 1011.1813.

[17]  Michael J. Freedman,et al.  Scalable Inference of Overlapping Communities , 2012, NIPS.

[18]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Thomas L. Griffiths,et al.  Learning Systems of Concepts with an Infinite Relational Model , 2006, AAAI.