A practical test for a planted community in heterogeneous networks
Mingao Yuan, Qian Wen

TL;DR
This paper introduces a practical, polynomial-time statistical test for detecting planted dense communities in heterogeneous networks, addressing the limitations of existing methods in terms of computational complexity and applicability.
Contribution
It proposes a new efficient test with a standard normal null distribution, suitable for large heterogeneous networks, and provides theoretical and empirical validation.
Findings
The test has a standard normal distribution under the null hypothesis.
The test demonstrates good power in simulations and real data.
It is computationally feasible for large networks.
Abstract
One of the fundamental task in graph data mining is to find a planted community(dense subgraph), which has wide application in biology, finance, spam detection and so on. For a real network data, the existence of a dense subgraph is generally unknown. Statistical tests have been devised to testing the existence of dense subgraph in a homogeneous random graph. However, many networks present extreme heterogeneity, that is, the degrees of nodes or vertexes don't concentrate on a typical value. The existing tests designed for homogeneous random graph are not straightforwardly applicable to the heterogeneous case. Recently, scan test was proposed for detecting a dense subgraph in heterogeneous(inhomogeneous) graph(\cite{BCHV19}). However, the computational complexity of the scan test is generally not polynomial in the graph size, which makes the test impractical for large or moderate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Stochastic processes and statistical mechanics · Data Management and Algorithms
