Central limit theorems for the eigenvalues of graph Laplacians on data clouds
Chenghui Li, Nicol\'as Garc\'ia Trillos, Housen Li, Leo Suchan

TL;DR
This paper establishes central limit theorems for the eigenvalues of graph Laplacians constructed from data points on a manifold, providing a Gaussian fluctuation description and statistical efficiency insights.
Contribution
It introduces the first CLTs for eigenvalues of graph Laplacians on data clouds, with explicit asymptotic variance and geometric interpretation, linking to Fisher-Rao and Cramer-Rao bounds.
Findings
Eigenvalues are asymptotically Gaussian with explicit variance.
Results hold under suitable assumptions on data and graph parameters.
Numerical experiments support theoretical findings.
Abstract
Given i.i.d.\ samples from a distribution supported on a low dimensional manifold embedded in Eucliden space, we consider the graph Laplacian operator associated to an -proximity graph over and study the asymptotic fluctuations of its eigenvalues around their means. In particular, letting denote the -th eigenvalue of , and under suitable assumptions on the data generating model and on the rate of decay of , we prove that is asymptotically Gaussian with a variance that we can explicitly characterize. A formal argument allows us to interpret this asymptotic variance as the dissipation of a gradient flow of a suitable energy with respect to the Fisher-Rao geometry. This geometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Statistical Mechanics and Entropy · Geometric Analysis and Curvature Flows
