Spectra of adjacency and Laplacian matrices of Erdős-Rényi hypergraphs
arXiv:2409.03756
Abstract
We study adjacency and Laplacian matrices of Erdős-Ré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ős-Ré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 $\frac{d_{\avg}}{r^7} \to \infty$, where $d_{\avg} = \binom{n-1}{r-1} p$. In contrast with the Erdős-Rényi random graph (), two eigenvalues stick out of the bulk of the spectrum. When is fixed and $d_{\avg} \gg n^{r - 2} \log^4 n$, we uncover an interesting Baik-Ben Arous-Péché (BBP) phase transition at the value . For , an appropriately scaled largest (resp. smallest) eigenvalue converges in probability to (resp. ), the right (resp. left) end point of the support of the standard semi-circle law, and when , it converges to (resp. ). Further, in a Gaussian version of the model we show that an appropriately scaled largest (resp. smallest) eigenvalue converges in distribution to (resp. ), where is a standard Gaussian. We also establish analogous results for the bulk and edge eigenvalues of the associated Laplacian matrices.