Random walk covering of some special trees

DOI10.1016/0022-247X(91)90149-TzbMATH Open0733.60092MaRDI QIDQ809480FDOQ809480

Authors: David Aldous 

Publication date: 1991

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

Recommendations

• scientific article; zbMATH DE number 3949430
• Random walks and trees
• scientific article; zbMATH DE number 1123792
• Extremal cover times for random walks on trees
• Cover time for branching random walks on regular trees
• Covering times of random walks on bounded degree trees and other graphs
• Random walks and dimensions of random trees
• Simple random walks on trees
• Branching random walks on trees

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)

Cites Work

• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Threshold limits for cover times
• The continuum random tree. I
• Extremal cover times for random walks on trees
• Title not available (Why is that?)
• Random walks on random trees
• Random walks on highly symmetric graphs
• A Technique for Lower Bounding the Cover Time
• Title not available (Why is that?)
• Covering times of random walks on bounded degree trees and other graphs
• An introduction to covering problems for random walks on graphs

Cited In (26)

• Commute times of random walks on trees
• Exponential convergence to equilibrium for a class of random-walk models
• The evolution of the cover time
• Barrier estimates for a critical Galton-Watson process and the cover time of the binary tree
• Exact computation for the cover times of certain classes of trees
• Tightness for the minimal displacement of branching random walk
• A scaling limit for the cover time of the binary tree
• A sharp estimate for cover times on binary trees
• Convergence of blanket times for sequences of random walks on critical random graphs
• Frogs on trees?
• On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees
• Exponential concentration of cover times
• From transience to recurrence with Poisson tree frogs
• Greedy Random Walk
• Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
• 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
• Cover times for sequences of reversible Markov chains on random graphs
• Cover time for the frog model on trees
• A spectral characterization for concentration of the cover time
• Cover time for branching random walks on regular trees
• Cover times, blanket times, and majorizing measures
• Covering with blocks in the non-symmetric case
• Tightness for a family of recursion equations
• Threshold limits for cover times
• Survival under random coverings of trees

This page was built for publication: Random walk covering of some special trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809480)