Building uniformly random subtrees

DOI10.1002/RSA.20011MaRDI QIDQ4739579zbMATH OpenOpenAlexFDO

Authors Peter Winkler, Malwina Luczak

Publication date 6 August 2004

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20011

zbMATH Keywords

Catalan numbersrandom generationrandom subtree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Uniformly random tree generation
• Growing random uniform d-ary trees
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• The generation of binary trees as a numerical problem
• The continuum random tree. I

Cites work

• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• The cycle lemma and some applications

Cited in

(18)

• Typicality and entropy of processes on infinite trees
• Limits of random tree-like discrete structures
• Parking on a random rooted plane tree
• Sub-trees of a random tree
• Growing random uniform d-ary trees
• Random infinite squarings of rectangles
• The evolution of the cover time
• Stochastic ordering of infinite geometric Galton-Watson trees
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• A non-increasing tree growth process for recursive trees and applications
• Parking on a random tree
• Comparing graphs of different sizes
• Growing uniform planar maps face by face
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• Models of random subtrees of a graph
• Order-invariant measures on causal sets
• Where do (random) trees grow leaves?
• On the silhouette of binary search trees

This page was built for publication: Building uniformly random subtrees

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