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

11/16/2018
by   Sam Cole, et al.
0

We consider the exact recovery problem in the hypergraph stochastic block model (HSBM) with k blocks of equal size. More precisely, we consider a random d-uniform hypergraph H with n vertices partitioned into k clusters of size s = n / k. Hyperedges e are added independently with probability p if e is contained within a single cluster and q otherwise, where 0 ≤ q < p ≤ 1. We present a spectral algorithm which recovers the clusters exactly with high probability, given mild conditions on n, k, p, q, and d. Our algorithm is based on the adjacency matrix of H, which we define to be the symmetric n × n matrix whose (u, v)-th entry is the number of hyperedges containing both u and v. To the best of our knowledge, our algorithm is the first to guarantee exact recovery when the number of clusters k=Θ(√(n)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2023

Exact recovery for the non-uniform Hypergraph Stochastic Block Model

Consider the community detection problem in random hypergraphs under the...
research
08/22/2017

Recovering Nonuniform Planted Partitions via Iterated Projection

In the planted partition problem, the n vertices of a random graph are p...
research
01/27/2023

Multilayer hypergraph clustering using the aggregate similarity matrix

We consider the community recovery problem on a multilayer variant of th...
research
10/20/2015

Optimal Cluster Recovery in the Labeled Stochastic Block Model

We consider the problem of community detection or clustering in the labe...
research
03/14/2022

Sparse random hypergraphs: Non-backtracking spectra and community detection

We consider the community detection problem in a sparse q-uniform hyperg...
research
05/11/2021

Exact Recovery in the General Hypergraph Stochastic Block Model

This paper investigates fundamental limits of exact recovery in the gene...
research
06/12/2023

Strong consistency and optimality of spectral clustering in symmetric binary non-uniform Hypergraph Stochastic Block Model

Consider the unsupervised classification problem in random hypergraphs u...

Please sign up or login with your details

Forgot password? Click here to reset