A spectral characterization for concentration of the cover time

DOI10.1007/s10959-019-00946-5zbMath1469.60232arXiv1809.00145OpenAlexW3103475719MaRDI QIDQ2209316

Jonathan Hermon

Publication date: 30 October 2020

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.00145

zbMATH Keywords

spectral gaphitting timesmixing timesvertex-transitive graphscover times

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (3)

Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ Mean field behavior during the big bang regime for coalescing random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Total variation and separation cutoffs are not equivalent and neither one implies the other
• On large deviations for the cover time of two-dimensional torus
• Gumbel fluctuations for cover times in the discrete torus
• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
• A sharp estimate for cover times on binary trees
• On cover times for 2D lattices
• Cover times, blanket times, and majorizing measures
• Mixing and hitting times for finite Markov chains
• Mixing times are hitting times of large sets
• The subleading order of two dimensional cover times
• Covering problems for Markov chains
• Random walk covering of some special trees
• Nilprogressions and groups with moderate growth
• The cutoff phenomenon for ergodic Markov processes
• Walks on generating sets of groups
• Moderate growth and random walk on finite groups
• Exponential concentration of cover times
• Cover times for Brownian motion and random walks in two dimensions
• Characterization of cutoff for reversible Markov chains
• Recurrence of Markov chain traces
• On an epidemic model on finite graphs
• Reversibility of the non-backtracking random walk
• A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
• Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
• Threshold limits for cover times
• Probability on Trees and Networks
• The Evolution of the Cover Time
• Tight inequalities among set hitting times in Markov chains
• The cover time of the giant component of a random graph
• Hitting times for random walks on vertex-transitive graphs
• Some Inequalities for Reversible Markov Chains
• A tight upper bound on the cover time for random walks on graphs
• A technical report on hitting times, mixing and cutoff
• A tight lower bound on the cover time for random walks on graphs

This page was built for publication: A spectral characterization for concentration of the cover time