Multilayer hypergraph clustering using the aggregate similarity matrix

01/27/2023
by   Kalle Alaluusua, et al.
0

We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-uniform HSBM on N vertices. Given the aggregated number of hyperedges incident to each pair of vertices, represented using a similarity matrix, the goal is to obtain a partition of the N vertices into disjoint communities. In this work, we investigate a semidefinite programming (SDP) approach and obtain information-theoretic conditions on the model parameters that guarantee exact recovery both in the assortative and the disassortative cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2021

Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection

In this paper, we study the information theoretic bounds for exact recov...
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
05/05/2021

Information Limits for Detecting a Subhypergraph

We consider the problem of recovering a subhypergraph based on an observ...
research
08/23/2022

Community Detection in the Hypergraph SBM: Optimal Recovery Given the Similarity Matrix

Community detection is a fundamental problem in network science. In this...
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
02/20/2021

ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network

The paper considers a Mixture Multilayer Stochastic Block Model (MMLSBM)...

Please sign up or login with your details

Forgot password? Click here to reset