The distance between points in random trees

DOI10.1016/S0021-9800(70)80012-6MaRDI QIDQ5578186zbMATH OpenFDO

Authors A. Meir, J. W. Moon

Publication date 1970

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(70)80012-6

zbMATH Keywords

probability theory

Cited in

(12)

• The generation of random, binary unordered trees
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• On the average number of nodes in a subtree of a tree
• Coloured Loop-Erased Random Walk on the Complete Graph
• On the Wiener index of random trees
• Components of Random Forests
• Cutting down trees with a Markov chainsaw
• The Wiener index of random digital trees
• Random walks on random trees
• Fast random generation of binary, t-ary and other types of trees
• Random trees have height \(O(\sqrt{n})\)
• Solving a random asymmetric TSP exactly in quasi-polynomial time w.h.p.

This page was built for publication: The distance between points in random trees

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