DeepAI AI Chat
Log In Sign Up

Hypergraph Clustering in the Weighted Stochastic Block Model via Convex Relaxation of Truncated MLE

03/23/2020
by   Jeonghwan Lee, et al.
6

We study hypergraph clustering under the weighted d-uniform hypergraph stochastic block model (d-WHSBM), where each edge consisting of d nodes has higher expected weight if d nodes are from the same community compared to edges consisting of nodes from different communities. We propose a new hypergraph clustering algorithm, which is a convex relaxation of truncated maximum likelihood estimator (CRTMLE), that can handle the relatively sparse, high-dimensional regime of the d-WHSBM with community sizes of different orders. We provide performance guarantees of this algorithm under a unified framework for different parameter regimes, and show that it achieves the order-wise optimal or the best existing results for approximately balanced community sizes. We also demonstrate the first recovery guarantees for the setting with growing number of communities of unbalanced sizes.

READ FULL TEXT

page 7

page 9

page 12

page 14

page 15

page 18

page 31

page 32

05/11/2021

Exact Recovery in the General Hypergraph Stochastic Block Model

This paper investigates fundamental limits of exact recovery in the gene...
01/24/2021

Generative hypergraph clustering: from blockmodels to modularity

Hypergraphs are a natural modeling paradigm for a wide range of complex ...
07/26/2023

Phase Transitions of Diversity in Stochastic Block Model Dynamics

This paper proposes a stochastic block model with dynamics where the pop...
12/28/2015

Convexified Modularity Maximization for Degree-corrected Stochastic Block Models

The stochastic block model (SBM) is a popular framework for studying com...
06/05/2023

A unified analysis of likelihood-based estimators in the Plackett–Luce model

The Plackett–Luce model is a popular approach for ranking data analysis,...
05/23/2018

Hypergraph Spectral Clustering in the Weighted Stochastic Block Model

Spectral clustering is a celebrated algorithm that partitions objects ba...
10/11/2012

Improved Graph Clustering

Graph clustering involves the task of dividing nodes into clusters, so t...