On the speed of random walks on graphs.

DOI10.1214/AOP/1019160123zbMath1044.60034OpenAlexW2035841531MaRDI QIDQ1872514

Bálint Virág

Publication date: 6 May 2003

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aop/1019160123

zbMATH Keywords

graphrandom walkrate of escapespeedhitting time

Mathematics Subject Classification ID

Applications of graph theory (05C90) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (7)

Speed of the biased random walk on a Galton-Watson tree ⋮ Random walks on regular trees can not be slowed down ⋮ Harmonic means ⋮ Branching number of a pseudogroup ⋮ Bounds on the speed and on regeneration times for certain processes on regular trees ⋮ On the speed of random walks on random trees ⋮ Harmonic measure for biased random walk in a supercritical Galton-Watson tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and percolation on trees
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Random walks on a tree and capacity in the interval
• Random walks on trees and an inequality of means
• Nonlinear self-tuning regulator for pH systems
• Average properties of random walks on Galton-Watson trees
• Infinite clusters in dependent automorphism invariant percolation on trees
• Random walk on periodic trees
• Biased random walks on directed trees
• Biased random walks on Galton-Watson trees
• Trees Generated by a Simple Branching Process
• Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure

This page was built for publication: On the speed of random walks on graphs.