A sharp estimate for cover times on binary trees

DOI10.1016/j.spa.2012.03.008zbMath1255.05179arXiv1104.0434OpenAlexW2001123643MaRDI QIDQ424523

Ofer Zeitouni, Jian Ding

Publication date: 1 June 2012

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

random walkGaussian free fieldcover time

Mathematics Subject Classification ID

Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items

Maxima of branching random walks with piecewise constant variance ⋮ Tightness for the cover time of the two dimensional sphere ⋮ A spectral characterization for concentration of the cover time ⋮ Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees ⋮ On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees ⋮ A scaling limit for the cover time of the binary tree ⋮ The subleading order of two dimensional cover times ⋮ Extremes of local times for simple random walks on symmetric trees ⋮ Geometry of the Gibbs measure for the discrete 2D Gaussian free field with scale-dependent variance ⋮ Limit law for the cover time of a random walk on a binary tree ⋮ Isomorphism Theorems: Markov Processes, Gaussian Processes and Beyond ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence in law of the minimum of a branching random walk
• Random walk covering of some special trees
• Tightness for a family of recursion equations
• Cover times for Brownian motion and random walks in two dimensions
• Entropic repulsion and the maximum of the two-dimensional harmonic crystal.
• Minima in branching random walks
• Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
• Tightness of the recentered maximum of the two-dimensional discrete Gaussian free field
• Maximal displacement of branching brownian motion
• Cover times, blanket times, and majorizing measures