Spectra of adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi hypergraphs
Soumendu Sundar Mukherjee, Dipranjan Pal, Himasish Talukdar

TL;DR
This paper analyzes the spectral properties of adjacency and Laplacian matrices of Erdős-Rényi hypergraphs, revealing convergence to semi-circle law, eigenvalue phase transitions, and distributional limits for large hypergraphs with varying uniformity.
Contribution
It provides the first detailed spectral analysis of hypergraph adjacency matrices, including phase transitions and eigenvalue distributions, extending classical graph results to hypergraphs.
Findings
Expected spectral distribution converges to semi-circle law.
Eigenvalues exhibit phase transitions at specific hyperedge sizes.
Largest and smallest eigenvalues converge to predictable limits.
Abstract
We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi -uniform hypergraphs on vertices with hyperedge inclusion probability , in the setting where can vary with such that . Adjacency matrices of hypergraphs are contractions of adjacency tensors and their entries exhibit long range correlations. We show that under the Erd\H{o}s-R\'{e}nyi model, the expected empirical spectral distribution of an appropriately normalised hypergraph adjacency matrix converges weakly to the semi-circle law with variance as long as , where . In contrast with the Erd\H{o}s-R\'{e}nyi random graph (), two eigenvalues stick out of the bulk of the spectrum. When is fixed and , we uncover an interesting Baik-Ben Arous-P\'{e}ch\'{e} (BBP) phase…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications
