Cover times for sequences of reversible Markov chains on random graphs

DOI10.1215/21562261-2693442zbMath1338.60181arXiv1206.0398OpenAlexW1998580722MaRDI QIDQ2258610

Yoshihiro Abe

Publication date: 26 February 2015

Published in: Kyoto Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsreversible Markov chainsGalton-Watson treescover timesmaximal hitting time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Random walks on graphs with interval weights and precise marginals, Maxima of branching random walks with piecewise constant variance, Effective resistances for supercritical percolation clusters in boxes, Geometry of the Gibbs measure for the discrete 2D Gaussian free field with scale-dependent variance, Brownian motion on stable looptrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of mixing times for sequences of random walks on finite graphs
• Cover times, blanket times, and majorizing measures
• Exact value of the resistance exponent for four dimensional random walk trace
• Random walk covering of some special trees
• Random walk on the range of random walk
• A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
• Random walks on Galton-Watson trees with infinite variance offspring distribution conditioned to survive
• Subdiffusive behavior of random walk on a random cluster
• Covering problems for Brownian motion on spheres
• Some new limit theorems for the critical branching process allowing immigration
• The electrical resistance of a graph captures its commute and cover times
• On the mixing time of a simple random walk on the super critical percolation cluster
• On the Diophantine equation \(x (x + 1) \dots (x + n) + 1 = y^2\)
• On the cover time of planar graphs
• A resistance bound via an isoperimetric inequality
• Gaussian free fields for mathematicians
• The Evolution of the Cover Time
• The cover time of the giant component of a random graph
• On the Cover Time for Random Walks on Random Graphs
• The Generic Chaining