Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes
The Electronic Journal of Combinatorics · 20.11.2026 · 33 (4)
DOI: 10.37236/15204 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 20.11.2026. Verfasst von Xiongfeng Zhan und 2 weiteren Autor:innen.
Abstract (Originalsprache)
This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary matrix-theoretic methods, we derive lower bounds for the eigenvalues of the combinatorial Laplacian in terms of the graph Laplacian spectrum and combinatorial parameters that measure the deviation from a flag complex. As a consequence, we obtain upper bounds on the dimension of cohomology groups. We also generalize an eigenvalue comparison inequality between a simplicial complex and its subcomplexes to arbitrary eigenvalues. As an application of the dimension bounds, we refine a result by Kahle (2007) on the vanishing of cohomology and connectivity in the neighborhood complex of the Erdős–Rényi random graph.
Zitieren
APA
Zhan, X., Huang, X., & Zhou, J. (2026). Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/15204
Vancouver
Zhan X, Huang X, Zhou J. Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/15204
BibTeX
@article{Zhan2026,
author = {Zhan, Xiongfeng and Huang, Xueyi and Zhou, Jin-Xin},
title = {Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {4},
doi = {10.37236/15204}
}
EUVIMED