Random walks on random trees

DOI10.1017/S144678870001274XMaRDI QIDQ5681384zbMATH OpenOpenAlexFDO

Authors J. 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)

Cites work

• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• On Cayley's Formula for Counting Trees
• The distance between points in random trees

Cited in

(10)

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

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

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