Phase Transitions in Spectral Community Detection of Large Noisy Networks

Abstract

In this paper, we study the sensitivity of the spectral clustering based community detection algorithm subject to a Erdos-Renyi type random noise model. We prove phase transitions in community detectability as a function of the external edge connection probability and the noisy edge presence probability under a general network model where two arbitrarily connected communities are interconnected by random external edges. Specifically, the community detection performance transitions from almost perfect detectability to low detectability as the inter-community edge connection probability exceeds some critical value. We derive upper and lower bounds on the critical value and show that the bounds are identical when the two communities have the same size. The phase transition results are validated using network simulations. Using the derived expressions for the phase transition threshold we propose a method for estimating this threshold from observed data.

conference paper at IEEE ICASSP 2015

References in corpus (6)

• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Discrete Signal Processing on Graphs
• Phase transition in the detection of modules in sparse networks
• Graph spectra and the detectability of community structure in networks
• Universal Phase Transition in Community Detectability under a Stochastic Block Model