Recovering Nonuniform Planted Partitions via Iterated Projection

08/22/2017
by   Sam Cole, et al.
0

In the planted partition problem, the n vertices of a random graph are partitioned into k "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 < q < p < 1). We give an efficient spectral algorithm that recovers the clusters with high probability, provided that the sizes of any two clusters are either very close or separated by ≥Ω(√(n)). We also discuss a generalization of planted partition in which the algorithm's input is not a random graph, but a random real symmetric matrix with independent above-diagonal entries. Our algorithm is an adaptation of a previous algorithm for the uniform case, i.e., when all clusters are size n / k ≥Ω(√(n)). The original algorithm recovers the clusters one by one via iterated projection: it constructs the orthogonal projection operator onto the dominant k-dimensional eigenspace of the random graph's adjacency matrix, uses it to recover one of the clusters, then deletes it and recurses on the remaining vertices. We show herein that a similar algorithm works in the nonuniform case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2018

Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm

We consider the exact recovery problem in the hypergraph stochastic bloc...
research
08/30/2017

A Compressive Sensing Approach to Community Detection with Applications

The community detection problem for graphs asks one to partition the n v...
research
11/24/2014

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

The binary symmetric stochastic block model deals with a random graph of...
research
08/03/2022

Network homophily via multi-dimensional extensions of Cantelli's inequality

Homophily is the principle whereby "similarity breeds connections". We g...
research
03/20/2019

Equitable partition of plane graphs with independent crossings into induced forests

The cluster of a crossing in a graph drawing on the plane is the set of ...
research
04/25/2011

Clustering Partially Observed Graphs via Convex Optimization

This paper considers the problem of clustering a partially observed unwe...
research
04/13/2020

Exact recovery and sharp thresholds of Stochastic Ising Block Model

The stochastic block model (SBM) is a random graph model in which the ed...

Please sign up or login with your details

Forgot password? Click here to reset