Community detection in dense random networks

原文摘要

We formalize the problem of detecting a community in a network into testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe an undirected and unweighted graph on $N$ nodes. Under the null hypothesis, the graph is a realization of an Erdős–Rényi graph with probability $p_{0}$. Under the (composite) alternative, there is an unknown subgraph of $n$ nodes where the probability of connection is $p_{1}>p_{0}$. We derive a detection lower bound for detecting such a subgraph in terms of $N$, $n$, $p_{0}$, $p_{1}$ and exhibit a test that achieves that lower bound. We do this both when $p_{0}$ is known and unknown. We also consider the problem of testing in polynomial-time. As an aside, we consider the problem of detecting a clique, which is intimately related to the planted clique problem. Our focus in this paper is in the quasi-normal regime where $np_{0}$ is either bounded away from zero, or tends to zero slowly.

摘要来源：OpenAlex 索引摘要（稿件版本未注明）