Random walk covering of some special trees

DOI10.1016/0022-247X(91)90149-TzbMath0733.60092MaRDI QIDQ809480

David J. Aldous

Publication date: 1991

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

branching processrandom walk on a finite tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05)

Related Items

From transience to recurrence with Poisson tree frogs, Covering with blocks in the non-symmetric case, Threshold limits for cover times, Convergence of blanket times for sequences of random walks on critical random graphs, A sharp estimate for cover times on binary trees, Cover times, blanket times, and majorizing measures, Commute times of random walks on trees, 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, The Evolution of the Cover Time, A scaling limit for the cover time of the binary tree, Frogs on trees?, Exponential concentration of cover times, Greedy Random Walk, Cover times for sequences of reversible Markov chains on random graphs, Limit law for the cover time of a random walk on a binary tree, The full spectrum of random walks on complete finite \(d\)-ary trees, Tightness for a family of recursion equations, Tightness for the minimal displacement of branching random walk, COVER TIME FOR THE FROG MODEL ON TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Covering times of random walks on bounded degree trees and other graphs
• The continuum random tree. I
• Random walks on highly symmetric graphs
• An introduction to covering problems for random walks on graphs
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Threshold limits for cover times
• A Technique for Lower Bounding the Cover Time
• Extremal cover times for random walks on trees
• Random walks on random trees