Abstract
We consider the adjacency operator of the Linial-Meshulam model for random simplicial complexes on n vertices, where each d-cell is added independently with probability p to the complete (d − 1)-skeleton. Under the assumption np(1 − p) » log4 n, we prove that the spectral gap between the (n-1d) smallest eigenvalues and the remaining (n-1d-1) eigenvalues is np − 2√dnp(1 − p) (1 + o(1)) with high probability. This estimate follows from a more general result on eigenvalue confinement. In addition, we prove that the global distribution of the eigenvalues is asymptotically given by the semicircle law. The main ingredient of the proof is a Füredi-Komlós-type argument for random simplicial complexes, which may be regarded as sparse random matrix models with dependent entries.
| Original language | English |
|---|---|
| Pages (from-to) | 506-537 |
| Number of pages | 32 |
| Journal | Random Structures and Algorithms |
| Volume | 51 |
| Issue number | 3 |
| DOIs | |
| State | Published - Oct 2017 |
Keywords
- #random simplicial complexes
- Linial Meshulam model
- random matrices
- spectral gap
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Eigenvalue confinement and spectral gap for random simplicial complexes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver