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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes

Khanh Duy Trinh, Shu Kanazawa
Random Structures and Algorithms
Topological and Geometric Data Analysis
article

Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes

Khanh Duy Trinh, Shu Kanazawa
article en

Abstract

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.

Random Structures and AlgorithmsVol. 66(1)
Waseda University (JP), Kyoto University (JP), The Ohio State University (US)
Japan Society for the Promotion of Science
Peace, Justice and strong institutions
Openalex Percentile: Top 84%
Topological and Geometric Data Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes — Khanh Duy Trinh, Shu Kanazawa · Random Structures and Algorithms (2024) | TGRS Research Map | TGRS