Sparse random hypergraphs: non-backtracking spectra and community detection

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Cites Work

Unnamed Item
Unnamed Item
Reconstruction and estimation in the planted partition model
Consistency of spectral hypergraph partitioning under planted partition model
Norms and exclusion theorems
Reconstruction on trees and spin glass transition
The zeta function of a hypergraph
Component structure in the evolution of random hypergraphs
An impossibility result for reconstruction in the degree-corrected stochastic block model
Information-theoretic thresholds from the cavity method
A proof of the block model threshold conjecture
Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
On the second eigenvalue of hypergraphs
Ramanujan hypergraphs
Spectra of regular graphs and hypergraphs and orthogonal polynomials
Spectra of hypergraphs and applications
Extremal eigenvalues of critical Erdős-Rényi graphs
Sparse random tensors: concentration, regularization and applications
Spectra of random regular hypergraphs
Testing community structure for hypergraphs
Spectral radii of sparse random matrices
Delocalization transition for critical Erdős-Rényi graphs
Adjacency spectra of random and complete hypergraphs
Exact recovery in the hypergraph stochastic block model: a spectral algorithm
Eigenvalues of random lifts and polynomials of random permutation matrices
Consistency of spectral clustering in stochastic block models
Non-backtracking spectra of weighted inhomogeneous random graphs
Spectral redemption in clustering sparse networks
Exact Recovery in the Stochastic Block Model
Loose laplacian spectra of random hypergraphs
A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
Community Detection and Stochastic Block Models
Proof of the Achievability Conjectures for the General Stochastic Block Model
An Introduction to Stein's Method
THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
Spectral Algorithms for Tensor Completion
Eigenvalues of the non-backtracking operator detached from the bulk
Graph Powering and Spectral Robustness
Nonconvex Low-Rank Tensor Completion from Noisy Data
Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
Deterministic Tensor Completion with Hypergraph Expanders
The Landscape of the Spiked Tensor Model
Community Recovery in Hypergraphs
On the Minimax Misclassification Ratio of Hypergraph Community Detection
Consistent community detection in multi-layer network data
Community detection thresholds and the weak Ramanujan property
Most Tensor Problems Are NP-Hard
Spectral gap in random bipartite biregular graphs and applications
Detection thresholds in very sparse matrix completion
Community detection in the sparse hypergraph stochastic block model
Global eigenvalue fluctuations of random biregular bipartite graphs
Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
Learning sparse graphons and the generalized Kesten-Stigum threshold
On Estimating Rank-One Spiked Tensors in the Presence of Heavy Tailed Errors
Exact Recovery in the General Hypergraph Stochastic Block Model
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph

This page was built for publication: Sparse random hypergraphs: non-backtracking spectra and community detection