Simulating Size-constrained Galton-Watson Trees

We discuss various methods for generating random Galton-Watson trees conditional on their sizes being equal to $n$. A linear expected time algorithm is proposed.

[1]  Erkki Mäkinen,et al.  A Note on Rémy's Algorithm for Generating Random Binary Trees , 2003 .

[2]  Manuel A. Lopez.  Analysis of Algorithms and Data Structures , 2011 .

[3]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

[4]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[5]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[6]  A. Meir,et al.  The distance between points in random trees , 1970 .

[7]  A. V. Boyd,et al.  Formal power series and the total progeny in a branching process , 1971 .

[8]  David Aldous,et al.  Asymptotic Fringe Distributions for General Families of Random Trees , 1991 .

[9]  Nachum Dershowitz,et al.  The Cycle Lemma and Some Applications , 1990, Eur. J. Comb..

[10]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[11]  Renzo Sprugnoli,et al.  The Random Generation of Directed Animals , 1994, Theor. Comput. Sci..

[12]  Wolfgang Hörmann,et al.  Automatic Nonuniform Random Variate Generation , 2011 .

[13]  Robert Cori,et al.  Une Preuve Combinatiore de la Rationalité d'une Série Génératrice Associée aux Arbres , 1982, RAIRO - Theoretical Informatics and Applications.

[14]  V. Statulevičius,et al.  Limit Theorems of Probability Theory , 2000 .

[15]  Joachim H. Ahrens,et al.  Sampling from binomial and poisson distributions: A method with bounded computation times , 1980, Computing.

[16]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[17]  Laurent Alonso.  Structures arborescentes : algorithme de generation, probleme de l'inclusion, relations maximin , 1992 .

[18]  Alberto Del Lungo,et al.  Random Generation of Trees and Other Combinatorial Objects , 1999, Theor. Comput. Sci..

[19]  Joachim H. Ahrens,et al.  Computer methods for sampling from gamma, beta, poisson and bionomial distributions , 1974, Computing.

[20]  Dominique Gouyou-Beauchamps,et al.  Combinatorics and Random Generation , 2003 .

[21]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[22]  Alexandr A. Borovkov,et al.  Limit Theorems of Probability Theory. , 2011 .

[23]  D. P. Kennedy,et al.  The Galton-Watson process conditioned on the total progeny , 1975, Journal of Applied Probability.

[24]  de Ng Dick Bruijn,et al.  THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[25]  Jean-Luc Rémy,et al.  Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération Aléatoire , 1985, RAIRO Theor. Informatics Appl..

[26]  Voratas Kachitvichyanukul,et al.  Algorithm 678: BTPEC: sampling from the binomial distribution , 1989, TOMS.

[27]  Voratas Kachitvichyanukul,et al.  Binomial random variate generation , 1988, CACM.

[28]  A. Shiryayev.  On Sums of Independent Random Variables , 1992 .

[29]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[30]  J. Moon.  Counting labelled trees , 1970 .

[31]  Luc Devroye,et al.  Generating sums in constant average time , 1988, 1988 Winter Simulation Conference Proceedings.

[32]  E. Stadlober,et al.  The ratio of uniforms approach for generating discrete random variates , 1990 .

[33]  Bruce W. Schmeiser,et al.  Beta Variate Generation via Exponential Majorizing Functions , 1980, Oper. Res..

[34]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[35]  Erkki Mäkinen,et al.  Generating Random Binary Trees - A Survey , 1999, Inf. Sci..

[36]  Wojciech Rytter,et al.  Analysis of algorithms and data structures , 1991, International computer science series.

[37]  Peter Winkler,et al.  Building uniformly random subtrees , 2004, Random Struct. Algorithms.

[38]  René Schott,et al.  Uniform Generation of a Schröder Tree , 1997, Inf. Process. Lett..

[39]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[40]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[41]  René Schott,et al.  A linear-time algorithm for the generation of trees , 1997, Algorithmica.

[42]  J. Moon,et al.  On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.

[43]  Alain Denise.  Methodes de generation aleatoire d'objet combinatoires de grande taille et problemes d'enumeration , 1994 .

[44]  A. Cayley.  A theorem on trees , 2009 .

[45]  Mireille Bousquet-Mélou,et al.  Generating functions for generating trees , 2002, Discret. Math..

[46]  Luc Devroye,et al.  A simple generator for discrete log-concave distributions , 1987, Computing.

[47]  Wolfgang Hörmann.  The generation of binomial random variates , 1993 .

[48]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[49]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[50]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[51]  L. Alonso,et al.  Random Generation of Trees , 1995, Springer US.

[52]  Guy Louchard,et al.  Random Sampling from Boltzmann Principles , 2002, ICALP.

[53]  Ernst Stadlober,et al.  Sampling from Poisson, binomial and hypergeometric distributions: ratio of uniforms as a simple and fast alternative , 1989 .

[54]  Béla Bollobás,et al.  Random Graphs , 1985 .

[55]  Jacques Cohen,et al.  Uniform Random Generation of Strings in a Context-Free Language , 1983, SIAM J. Comput..