Random walk covering of some special trees

DOI10.1016/0022-247X(91)90149-TMaRDI QIDQ809480zbMATH OpenFDO

Authors David Aldous

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0022-247X(91)90149-T

zbMATH Keywords

branching processrandom walk on a finite tree

Mathematics Subject Classification ID

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

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

Cites work

• A Technique for Lower Bounding the Cover Time
• An introduction to covering problems for random walks on graphs
• Covering times of random walks on bounded degree trees and other graphs
• Extremal cover times for random walks on trees
• scientific article; zbMATH DE number 747031 (Why is no real title available?)
• scientific article; zbMATH DE number 4113631 (Why is no real title available?)
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Random walks on highly symmetric graphs
• Random walks on random trees
• The continuum random tree. I
• Threshold limits for cover times

Cited in

(29)

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

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)