Detecting communities is hard, and counting them is even harder

Aviad Rubinstein

Home/Archive/arXiv

arXiv · 1611.08326

Detecting communities is hard, and counting them is even harder

Aviad Rubinstein

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph $G=\left(V,E\right)$, a subset $S\subseteq V$ is an $\left(\alpha,\beta\right)$-community if: * Every member of the community is friends with an $\alpha$-fraction of the community; * Every non-member is friends with at most a $\beta$-fraction of the community. Arora et al [AGSS12] gave a quasi-polynomial time algorithm for enumerating all the $\left(\alpha,\beta\right)$-communities for any constants $\alpha>\beta$. Here, we prove that, assuming the Exponential Time Hypothesis (ETH), quasi-polynomial time is in fact necessary - and even for a much weaker approximation desideratum. Namely, distinguishing between: * $G$ contains an $\left(1,o\left(1\right)\right)$-community; and * $G$ does not contain an $\left(\beta+o\left(1\right),\beta\right)$-community for any $\beta\in\left[0,1\right]$. We also prove that counting the number of $\left(1,o\left(1\right)\right)$-communities requires quasi-polynomial time assuming the weaker #ETH.

Explore related subjects

cs.CC cs.DS cs.SI physics.soc-ph

Keep this discovery

BibTeX RIS

Aviad Rubinstein. 2016-11-25. Detecting communities is hard, and counting them is even harder. https://arxiv.org/abs/1611.08326

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗