Overlapping stochastic block models with application to the French political blogosphere

Abstract

Published in at http://dx.doi.org/10.1214/10-AOAS382 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)International audienceComplex systems in nature and in society are often represented as networks, describing the rich set of interactions between objects of interest. Many deterministic and probabilistic clustering methods have been developed to analyze such structures. Given a network, almost all of them partition the vertices into disjoint clusters, according to their connection profile. However, recent studies have shown that these techniques were too restrictive and that most of the existing networks contained overlapping clusters. To tackle this issue, we present in this paper the Overlapping Stochastic Block Model. Our approach allows the vertices to belong to multiple clusters, and, to some extent, generalizes the well-known Stochastic Block Model [Nowicki and Snijders (2001)]. We show that the model is generically identifiable within classes of equivalence and we propose an approximate inference procedure, based on global and local variational techniques. Using toy data sets as well as the French Political Blogosphere network and the transcriptional network of Saccharomyces cerevisiae, we compare our work with other approaches

Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities

“…(), however, shares the limitations of the (degree‐corrected) stochastic block model, in the sense that it cannot model overlapping community structures, since each node belongs to a single community; see Latouche et al . () and Yang and Leskovec () for more discussion along these lines. Other extensions with block structure or mixed membership block structure were also suggested by Borgs et al .…”

Hypothesis Testing for Automated Community Detection in Networks

“…A stochastic block model is a special class of these models, where is a binary length k vector encoding membership of a node in a cluster. This has been a widely popular model (Snijders and Nowicki, ; Bickel and Chen, ; Birmelé and Ambroise, ) for modelling community structure in networks.…”

New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models

“…, 2008; Erosheva et al. , 2004) and overlapping (Latouche et al. , 2011a) stochastic block models for binary networks, in which nodes may belong to several classes.…”