A Combinatorial Characterization of Constant Mixing Time
Data Structures and Algorithms
2025-12-02 v2 Combinatorics
Abstract
Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set bipartite density condition, which is weaker than having near-optimal spectral radius and is stronger than having near-optimal small-set vertex expansion.
Keywords
Cite
@article{arxiv.2511.21868,
title = {A Combinatorial Characterization of Constant Mixing Time},
author = {Lap Chi Lau and Raymond Liu},
journal= {arXiv preprint arXiv:2511.21868},
year = {2025}
}