Spectra of adjacency and Laplacian matrices of Erdos-R\'enyi hypergraphs

Abstract

We study adjacency and Laplacian matrices of Erdos-R\'enyi r-uniform hypergraphs on n vertices with hyperedge inclusion probability p, in the setting where r can vary with n such that r / n c ∈ [0, 1). Adjacency matrices of hypergraphs are contractions of adjacency tensors and their entries exhibit long range correlations. We show that under the Erdos-R\'enyi model, the expected empirical spectral distribution of an appropriately normalised hypergraph adjacency matrix converges weakly to the semi-circle law with variance (1 - c)2 as long as dr7 ∞, where d = n-1r-1 p. In contrast with the Erdos-R\'enyi random graph (r = 2), two eigenvalues stick out of the bulk of the spectrum. When r is fixed and d nr - 2 4 n, we uncover an interesting Baik-Ben Arous-P\'ech\'e (BBP) phase transition at the value r = 3. For r ∈ \2, 3\, an appropriately scaled largest (resp. smallest) eigenvalue converges in probability to 2 (resp. -2), the right (resp. left) end point of the support of the standard semi-circle law, and when r 4, it converges to r - 2 + 1r - 2 (resp. -r - 2 - 1r - 2). Further, in a Gaussian version of the model we show that an appropriately scaled largest (resp. smallest) eigenvalue converges in distribution to c2 ζ + [c24ζ2 + c(1 - c)]1/2 (resp. c2 ζ - [c24ζ2 + c(1 - c)]1/2), where ζ is a standard Gaussian. We also establish analogous results for the bulk and edge eigenvalues of the associated Laplacian matrices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…