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