Abstract
We consider the problem of detecting a tight community in a sparse random network. This is formalized as testing for the existence of a dense random subgraph in a random graph. Under the null hypothesis, the graph is a realization of an Erdős–Rényi graph on
Citation
Nicolas Verzelen. Ery Arias-Castro. "Community detection in sparse random networks." Ann. Appl. Probab. 25 (6) 3465 - 3510, December 2015. https://doi.org/10.1214/14-AAP1080
Information