Time-Biased Random Walks and Robustness of Expanders

View at publisher
Authors: Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester
Cited by: 0

Abstract

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral gap \(\gamma\) bounded away from 0.

Fields of Study & Subjects

Markov Chains and Monte Carlo Methods Theoretical and Computational Physics Stochastic processes and statistical mechanics

Publication details

Journal / source
Society for Industrial and Applied Mathematics eBooks
Pages
2928–2941
Publication date
1 January 2026
Language
EN