Simulating size-constrained Galton-Watson trees

DOI10.1137/090766632MaRDI QIDQ2884570zbMATH OpenOpenAlexFDO

Authors Luc Devroye

Publication date 30 May 2012

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090766632

zbMATH Keywords

Catalan treesCayley treesexpected time analysisGalton-Watson branching processgraphical examplesrandom treesrandom variate generationsimulation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Pseudo-random numbers; Monte Carlo methods (11K45) Random number generation in numerical analysis (65C10)

Cited in

(11)

• Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
• On the maximal offspring in a subcritical branching process
• Growing random uniform d-ary trees
• Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
• Inference for conditioned Galton-Watson trees from their Harris path
• Root estimation in Galton–Watson trees
• Exact-Size Sampling of Enriched Trees in Linear Time
• Scaling limits of slim and fat trees
• Models of random subtrees of a graph
• Holonomic equations and efficient random generation of binary trees
• Maximum likelihood estimation for spinal-structured trees

This page was built for publication: Simulating size-constrained Galton-Watson trees

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