Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes
Abstract We study the adjacency matrix of the Linial–Meshulam complex model, which is a higher‐dimensional generalization of the Erdős–Rényi graph model. Recently, Knowles and Rosenthal proved that the empirical spectral distribution of the adjacency matrix is asymptotically given by Wigner's semicircle law in a diluted regime. In this article, we prove a central limit theorem for the linear eigenvalue statistics for test functions of polynomial growth that is of class on a closed interval. The proof is based on higher‐dimensional combinatorial enumerations and concentration properties of random symmetric matrices. Furthermore, when the test function is a polynomial function, we obtain the explicit formula for the variance of the limiting Gaussian distribution.
Authors
- Khanh Duy Trinh (ORCID: https://orcid.org/0000-0002-5801-7054)
- Shu Kanazawa (ORCID: https://orcid.org/0000-0002-3368-1629)
Institutions
- Waseda University (JP)
- Kyoto University (JP)
- The Ohio State University (US)
Publication Details
- Journal
- Random Structures and Algorithms
- Published
- 2024-08-12
- DOI
- https://doi.org/10.1002/rsa.21257
- Primary Topic
- Topological and Geometric Data Analysis
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Japan Society for the Promotion of Science