A spectral characterization for concentration of the cover time
type: Item
instance of: scholarly article
title: A spectral characterization for concentration of the cover time
zbMATH Open document ID: 1469.60232
author: Jonathan Hermon
published in: Journal of Theoretical Probability
publication date: 2020-10-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/1809.00145
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J27
zbMATH DE Number: 7268526
zbMATH Keywords: mixing times
zbMATH Keywords: hitting times
zbMATH Keywords: cover times
zbMATH Keywords: vertex-transitive graphs
zbMATH Keywords: spectral gap
MaRDI profile type: Publication
OpenAlex ID: W3103475719
arXiv ID: 1809.00145
cites work: Hitting times for random walks on vertex-transitive graphs
cites work: Random walk covering of some special trees
cites work: Some Inequalities for Reversible Markov Chains
cites work: Threshold limits for cover times
cites work: The Evolution of the Cover Time
cites work: Characterization of cutoff for reversible Markov chains
cites work: Gumbel fluctuations for cover times in the discrete torus
cites work: The subleading order of two dimensional cover times
cites work: Recurrence of Markov chain traces
cites work: On an epidemic model on finite graphs
cites work: Nilprogressions and groups with moderate growth
cites work: The cutoff phenomenon for ergodic Markov processes
cites work: On large deviations for the cover time of two-dimensional torus
cites work: The cover time of the giant component of a random graph
cites work: Moderate growth and random walk on finite groups
cites work: Cover times for Brownian motion and random walks in two dimensions
cites work: Walks on generating sets of groups
cites work: Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
cites work: On cover times for 2D lattices
cites work: Cover times, blanket times, and majorizing measures
cites work: A sharp estimate for cover times on binary trees
cites work: A tight lower bound on the cover time for random walks on graphs
cites work: A tight upper bound on the cover time for random walks on graphs
cites work: Tight inequalities among set hitting times in Markov chains
cites work: A technical report on hitting times, mixing and cutoff
cites work: Reversibility of the non-backtracking random walk
cites work: Total variation and separation cutoffs are not equivalent and neither one implies the other
cites work: A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
cites work: Q4595047
cites work: Q4208451
cites work: Probability on trees and networks
cites work: Covering problems for Markov chains
cites work: Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
cites work: Mixing and hitting times for finite Markov chains
cites work: Mixing times are hitting times of large sets
cites work: Exponential concentration of cover times
DOI: 10.1007/S10959-019-00946-5
description: scientific article