Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
DOI10.1137/22m1494713zbMath1517.05096arXiv2204.13586OpenAlexW4367177944MaRDI QIDQ6104310
Nicole Eikmeier, Jamie Haddock, Philip Chodrow
Publication date: 28 June 2023
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.13586
eigenvaluesphase transitionshypergraphscommunity detectionnonbacktracking matrixdetectability thresholds
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Statistical aspects of big data and data science (62R07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction and estimation in the planted partition model
- Consistency of spectral hypergraph partitioning under planted partition model
- Networks beyond pairwise interactions: structure and dynamics
- The zeta function of a hypergraph
- Ising models on locally tree-like graphs
- Gibbs measures and phase transitions on sparse random graphs
- A proof of the block model threshold conjecture
- Spectral theory of Laplace operators on oriented hypergraphs
- Random walks and Laplacians on hypergraphs: when do they match?
- Consistency of spectral clustering in stochastic block models
- Consistency of spectral clustering
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- ggplot2
- Julia: A Fresh Approach to Numerical Computing
- Spectral redemption in clustering sparse networks
- Numerical Methods for Large Eigenvalue Problems
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Communities in Networks
- Community Detection and Stochastic Block Models
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- Normalized Laplace operators for hypergraphs with real coefficients
- Configuration models of random hypergraphs
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
- Eigenvalues of the non-backtracking operator detached from the bulk
- Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing
- Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities
- Fast unfolding of communities in large networks
- Community detection thresholds and the weak Ramanujan property
- Spectral theory of weighted hypergraphs via tensors
This page was built for publication: Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
