Random walks on random trees

DOI10.1017/S144678870001274XzbMath0265.60065OpenAlexW2049587783MaRDI QIDQ5681384

John W. Moon

Publication date: 1973

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s144678870001274x

Mathematics Subject Classification ID

Trees (05C05) Sums of independent random variables; random walks (60G50)

Related Items (9)

Diffusive estimates for random walks on stationary random graphs of polynomial growth ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ Random walks on trees ⋮ Memoryless routing in convex subdivisions: random walks are optimal ⋮ Mixing time bounds via bottleneck sequences ⋮ Covering times of random walks on bounded degree trees and other graphs ⋮ An introduction to covering problems for random walks on graphs ⋮ Extremal first passage times for trees ⋮ Random walk covering of some special trees

Cites Work

• On Cayley's Formula for Counting Trees
• The distance between points in random trees
• Unnamed Item

This page was built for publication: Random walks on random trees