Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes

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.

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-11-20
DOI
https://doi.org/10.37236/15204
Citations
1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes

1 citations
The Electronic Journal of Combinatorics
Graph theory and applications
article

Eigenvalue Bounds for Combinatorial Laplacians and an Application to Random Complexes

article en
1 citations

Abstract

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.

The Electronic Journal of CombinatoricsVol. 33(4)
Beijing Jiaotong University (CN)
Natural Science Foundation of Shanghai, National Natural Science Foundation of China
Graph theory and applications
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.

Laika access coming soon