Skip to Main content Skip to Navigation
Journal articles

Detecting a planted community in an inhomogeneous random graph

Abstract : We study the problem of detecting whether an inhomogeneous random graph contains a planted community. Specifically, we observe a single realization of a graph. Under the null hypothesis, this graph is a sample from an inhomogeneous random graph, whereas under the alternative, there exists a small subgraph where the edge probabilities are increased by a multiplicative scaling factor. We present a scan test that is able to detect the presence of such a planted community, even when this community is very small and the underlying graph is inhomogeneous. We also derive an information theoretic lower bound for this problem which shows that in some regimes the scan test is almost asymptotically optimal. We illustrate our results through examples and numerical experiments.
Document type :
Journal articles
Complete list of metadata
Contributor : Nicolas Verzelen <>
Submitted on : Wednesday, October 14, 2020 - 2:38:15 PM
Last modification on : Saturday, April 24, 2021 - 3:33:39 AM

Links full text



Kay Bogerd, Rui M. Castro, Remco van der Hofstad, Nicolas Verzelen. Detecting a planted community in an inhomogeneous random graph. Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2021, 27 (2), pp.1159-1188. ⟨10.3150/20-BEJ1269⟩. ⟨hal-02966844⟩



Record views