Consistency of Spectral Hypergraph Partitioning under Planted Partition Model

by   Debarghya Ghoshdastidar, et al.

Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs. However, theoretical aspects of such methods have seldom received attention in the literature as compared to the extensive studies on the guarantees of graph partitioning. For instance, consistency results of spectral graph partitioning under the stochastic block model are well known. In this paper, we present a planted partition model for sparse random non-uniform hypergraphs that generalizes the stochastic block model. We derive an error bound for a spectral hypergraph partitioning algorithm under this model using matrix concentration inequalities. To the best of our knowledge, this is the first consistency result related to partitioning non-uniform hypergraphs.


page 1

page 2

page 3

page 4


Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block Model

We consider the community detection problem in sparse random hypergraphs...

Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques

In a series of recent works, we have generalised the consistency results...

Hypergraph Partitioning using Tensor Eigenvalue Decomposition

Hypergraphs have gained increasing attention in the machine learning com...

Distributed Matrix Tiling Using A Hypergraph Labeling Formulation

Partitioning large matrices is an important problem in distributed linea...

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications

We study the balanced k-way hypergraph partitioning problem, with a spec...

Joins of Hypergraphs and Their Spectra

Here, we represent a general hypergraph by a matrix and study its spectr...

Please sign up or login with your details

Forgot password? Click here to reset