Computational Lower Bounds for Community Detection on Random Graphs

06/25/2014
by   Bruce Hajek, et al.
0

This paper studies the problem of detecting the presence of a small dense community planted in a large Erdős-Rényi random graph G(N,q), where the edge probability within the community exceeds q by a constant factor. Assuming the hardness of the planted clique detection problem, we show that the computational complexity of detecting the community exhibits the following phase transition phenomenon: As the graph size N grows and the graph becomes sparser according to q=N^-α, there exists a critical value of α = 2/3, below which there exists a computationally intensive procedure that can detect far smaller communities than any computationally efficient procedure, and above which a linear-time procedure is statistically optimal. The results also lead to the average-case hardness results for recovering the dense community and approximating the densest K-subgraph.

READ FULL TEXT
research
09/07/2019

Community detection in inhomogeneous random graphs

We study the problem of detecting whether an inhomogeneous random graph ...
research
03/09/2023

Phase transition for detecting a small community in a large network

How to detect a small community in a large network is an interesting pro...
research
04/09/2015

Phase Transitions in Spectral Community Detection of Large Noisy Networks

In this paper, we study the sensitivity of the spectral clustering based...
research
06/22/2022

A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis

Community detection is a fundamental network-analysis primitive with a v...
research
10/05/2021

Inferring Hidden Structures in Random Graphs

We study the two inference problems of detecting and recovering an isola...
research
12/21/2022

Is it easier to count communities than find them?

Random graph models with community structure have been studied extensive...
research
01/15/2021

A practical test for a planted community in heterogeneous networks

One of the fundamental task in graph data mining is to find a planted co...

Please sign up or login with your details

Forgot password? Click here to reset