2000 character limit reached
Detectability thresholds of general modular graphs (1608.08908v2)
Published 31 Aug 2016 in cs.SI and physics.soc-ph
Abstract: We investigate the detectability thresholds of various modular structures in the stochastic block model. Our analysis reveals how the detectability threshold is related to the details of the modular pattern, including the hierarchy of the clusters. We show that certain planted structures are impossible to infer regardless of their fuzziness.