Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs
Alan Lew

TL;DR
This paper analyzes the asymptotic eigenvalue behavior of the Laplacian on a flag complex of subspaces over finite fields, confirming a conjecture for the 0-dimensional case as the field size grows.
Contribution
It determines the eigenvalue distribution of the Laplacian on flag complexes as the field size increases, solving a specific case of Papikian's conjecture.
Findings
Number of distinct eigenvalues stabilizes for large q
Non-zero eigenvalues tend to n-2 as q increases
Confirmed the 0-dimensional case of Papikian's conjecture
Abstract
Let be the simplicial complex whose vertices are the non-trivial subspaces of and whose simplices correspond to families of subspaces forming a flag. Let be the -dimensional weighted upper Laplacian on . The spectrum of was first studied by Garland, who obtained a lower bound on its non-zero eigenvalues. Here, we focus on the case. We determine the asymptotic behavior of the eigenvalues of as tends to infinity. In particular, we show that for large enough , has exactly distinct eigenvalues, and that every eigenvalue of tends to as goes to infinity. This solves the -dimensional case of a…
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
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Markov Chains and Monte Carlo Methods
