Answers are grounded in this paper and cite their sources.
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₀. Under the (composite) alternative, there is an unknown subgraph of n nodes where the probability of connection is p₁>p₀. We derive a detection lower bound for detecting such a subgraph in terms of N, n, p₀, p₁ and exhibit a test that achieves that lower bound. We do this both when p₀ 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₀ is either bounded away from zero, or tends to zero slowly.
No takes yet. Share an insight, caveat, or question.
Arias-Castro et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: