no code implementations • 12 Jun 2023 • Haixiao Wang
Consider the unsupervised classification problem in random hypergraphs under the non-uniform \emph{Hypergraph Stochastic Block Model} (HSBM) with two equal-sized communities ($n/2$), where each edge appears independently with some probability depending only on the labels of its vertices.
no code implementations • 25 Apr 2023 • Ioana Dumitriu, Haixiao Wang
Consider the community detection problem in random hypergraphs under the non-uniform hypergraph stochastic block model (HSBM), where each hyperedge appears independently with some given probability depending only on the labels of its vertices.
no code implementations • 22 Dec 2021 • Ioana Dumitriu, Haixiao Wang, Yizhe Zhu
When the random hypergraph has bounded expected degrees, we provide a spectral algorithm that outputs a partition with at least a $\gamma$ fraction of the vertices classified correctly, where $\gamma\in (0. 5, 1)$ depends on the signal-to-noise ratio (SNR) of the model.