Spectra of random regular hypergraphs

Abstract

In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs. We then relate the second eigenvalues to both its expansion property and the mixing rate of the non-backtracking random walk on regular hypergraphs. We also prove the spectral gap for the non-backtracking operator of a random regular hypergraph introduced in Angelini et al. (2015). Finally, we obtain the convergence of the empirical spectral distribution (ESD) for random regular hypergraphs in different regimes. Under certain conditions, we can show a local law for the ESD.

19 pages, 2 figures. Minor revision

References in corpus (2)

• A class of network models recoverable by spectral clustering
• Quantum walks on regular uniform hypergraphs

Cited by in corpus (6)

• Out-of-time-order correlators and Lyapunov exponents in sparse SYK
• Sparse random tensors: Concentration, regularization and applications
• Random Recursive Hypergraphs
• Global eigenvalue fluctuations of random biregular bipartite graphs
• Extreme singular values of inhomogeneous sparse random rectangular matrices
• Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block Model