A scaling limit for the cover time of the binary tree
From MaRDI portal
Publication:2232723
DOI10.1016/j.aim.2021.107974zbMath1473.05287arXiv1812.10101OpenAlexW3193392656MaRDI QIDQ2232723
Aser Cortines, Santiago Saglietti, Oren Louidor
Publication date: 8 October 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10101
local timebranching random walkGaussian free fieldGaussian multiplicative chaoscover timelogarithmically correlated fields
Trees (05C05) Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Random walks on graphs (05C81)
Related Items (6)
Avoided points of two-dimensional random walks ⋮ Exceptional points of two-dimensional random walks at multiples of the cover time ⋮ Tightness for the cover time of the two dimensional sphere ⋮ Exceptional points of discrete-time random walks in planar domains ⋮ A limit law for the most favorite point of simple random walk on a regular tree ⋮ Characterisation of planar Brownian multiplicative chaos
Cites Work
- Unnamed Item
- Convergence in law of the minimum of a branching random walk
- A sharp estimate for cover times on binary trees
- On cover times for 2D lattices
- Cover times, blanket times, and majorizing measures
- The subleading order of two dimensional cover times
- Convergence in law for the branching random walk seen from its tip
- Random walk covering of some special trees
- Tightness for a family of recursion equations
- Growth of random walks conditioned to stay positive
- Barrier estimates for a critical Galton-Watson process and the cover time of the binary tree
- Extremes of local times for simple random walks on symmetric trees
- Cover times for Brownian motion and random walks in two dimensions
- A Ray-Knight theorem for symmetric Markov processes.
- Tightness for the cover time of the two dimensional sphere
- The structure of extreme level sets in branching Brownian motion
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
- Genealogy of extremal particles of branching Brownian motion
- Convergence in Law of the Maximum of the Two‐Dimensional Discrete Gaussian Free Field
- Convergence of solutions of the Kolmogorov equation to travelling waves
This page was built for publication: A scaling limit for the cover time of the binary tree