Comparing Lower and Upper Spectral Gaps of Nonnegative Symmetric Matrices

We establish sharp estimates comparing the lower and upper spectral gaps of nonnegative symmetric matrices. Combining these comparisons with a multiplicity argument in the spirit of Li and Liu, we improve and extend earlier spectral gap comparison bounds of Saha and Li and Liu, which provide quantitative refinements of an observation of Breuillard, Green, Guralnick and Tao relating combinatorial expansion to two-sided spectral expansion. Our graph estimates hold for nonbipartite even-walk-regular graphs, which covers the classes of graphs, including vertex-transitive graphs, (twisted) Cayley graphs, and (twisted) Cayley sum graphs, investigated in previous work. Under an additional eigenmap assumption, we also establish quantitative two-sided comparisons between the lower and upper spectral gaps. In particular, these comparisons apply to walk-regular graphs.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24742
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Comparing Lower and Upper Spectral Gaps of Nonnegative Symmetric Matrices

Shiping Liu, Chunyang Hu, Yanlong Ding, Chiyu Zhou
arXiv (Cornell University)
Graph theory and applications
preprint

Comparing Lower and Upper Spectral Gaps of Nonnegative Symmetric Matrices

Shiping Liu, Chunyang Hu, Yanlong Ding, Chiyu Zhou
preprint en

Abstract

We establish sharp estimates comparing the lower and upper spectral gaps of nonnegative symmetric matrices. Combining these comparisons with a multiplicity argument in the spirit of Li and Liu, we improve and extend earlier spectral gap comparison bounds of Saha and Li and Liu, which provide quantitative refinements of an observation of Breuillard, Green, Guralnick and Tao relating combinatorial expansion to two-sided spectral expansion. Our graph estimates hold for nonbipartite even-walk-regular graphs, which covers the classes of graphs, including vertex-transitive graphs, (twisted) Cayley graphs, and (twisted) Cayley sum graphs, investigated in previous work. Under an additional eigenmap assumption, we also establish quantitative two-sided comparisons between the lower and upper spectral gaps. In particular, these comparisons apply to walk-regular graphs.

arXiv (Cornell University)
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