Community Detection in General Hypergraph via Graph Embedding
arXiv:2103.15035
Abstract
Conventional network data has largely focused on pairwise interactions between two entities, yet multi-way interactions among multiple entities have been frequently observed in real-life hypergraph networks. In this article, we propose a novel method for detecting community structure in general hypergraph networks, uniform or non-uniform. The proposed method introduces a null vertex to augment a non-uniform hypergraph into a uniform multi-hypergraph, and then embeds the multi-hypergraph in a low-dimensional vector space such that vertices within the same community are close to each other. The resultant optimization task can be efficiently tackled by an alternative updating scheme. The asymptotic consistencies of the proposed method are established in terms of both community detection and hypergraph estimation, which are also supported by numerical experiments on some synthetic and real-life hypergraph networks.
References in corpus (11)
- Fast community detection by SCORE
- Community extraction for social networks
- Coauthorship and Citation Networks for Statisticians
- Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
- Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
- Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration
- Adjacency and Tensor Representation in General Hypergraphs Part 1: e-adjacency Tensor Uniformisation Using Homogeneous Polynomials
- Hypergraph Clustering: A Modularity Maximization Approach
- Testing Community Structures for Hypergraphs
- Individualized Multi-directional Variable Selection
- Community Detection in Hypergraphs, Spiked Tensor Models, and Sum-of-Squares