Is it easier to count communities than find them?
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang

TL;DR
This paper demonstrates that inferring properties of community structures in random graphs is computationally as hard as actually finding the communities, establishing new lower bounds for such testing problems.
Contribution
It introduces the first computational lower bounds for testing between different planted community models using the low-degree polynomial framework.
Findings
Testing between two community models is as hard as community detection.
Established lower bounds for distinguishing planted distributions.
Linked recovery and testing frameworks in community detection.
Abstract
Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: might it be possible to infer properties of the community structure (for instance, the number and sizes of communities) even in situations where actually finding those communities is believed to be computationally hard? We show the answer is no. In particular, we consider certain hypothesis testing problems between models with different community structures, and we show (in the low-degree polynomial framework) that testing between two options is as hard as finding the communities. Our methods give the first computational lower bounds for testing between two different ``planted'' distributions, whereas…
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
Is it easier to count communities than find them?· youtube
Is it easier to count communities than find them?· youtube
Taxonomy
TopicsComplex Network Analysis Techniques · Stochastic processes and statistical mechanics · Data Management and Algorithms
