Building uniformly random subtrees

Random Structures and Algorithms

Volumn 24, Issue 4, 2004, Pages 420-443

  Luczak, Malwina ^a   Winkler, Peter ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Catalan numbers; Combinatorial structures; Lattice animal; Random generation; Random subtree

Indexed keywords

EID: 11144282667     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20011     Document Type: Article

References (30)

1. M. Aigner, Combinatorial theory, Springer-Verlag, Berlin, 1979.
2. L. Alonso, J. L. Rémy, and R. Schott, A linear-time algorithm for the generation of trees, Algorithmica 17(2) (1997), 162-182
3. K. B. Athreya and P. E. Ney, Branching processes, Springer-Verlag, Berlin, 1972.
4. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, and D. Gouyou-Beauchamps, Generating functions for generating trees, Discrete Math 246(1-3) (2002), 29-55.
5. E. Barcucci, A. Del Lungo, and E. Pergola, Random generation of trees and other combinatorial objects, Theor Comput Sci 218(2) (1999), 219-232.
6. E. Barcucci, R. Pinzani, and R. Sprugnoli, The random generation of directed animals, Theor Comput Sci 127(2) (1994), 333-350.
7. B. Bollobás, Combinatorics, Cambridge University Press, Cambridge, 1986.
8. G. R. Brightwell and P. Winkler, Graph homomorphisms and phase transitions, J Combin Theory Ser B 77 (1999), 221-262.
9. L. Comtet, Advanced combinatorics, Reidel, Dordrecht, 1994.
10. N. Dershowitz and S. Zaks, The cycle lemma and some applications, European J Combin 11 (1990), 35-40.
11. L. Devroye, "Branching processes," Probabilistic methods for algorithmic discrete mathematics, Eds. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed. Springer-Verlag, Berlin, (1998), 249-314.
12. P. Flajolet and A. M. Odlyzko, The average height of binary trees and other simple trees, J Comput System Sci 25 (1982), 171-213.
13. P. Flajolet, P. Zimmerman, and B. van Cutsem, A calculus for the random generation of labelled combinatorial structures, Theor Comput Sci 132 (1994), 1-35.
14. L. H. Harper, The morphology of partially ordered sets, J Combin Theory Ser A 17 (1974), 44-59.
15. S. Janson, "Ideals in a forest, one-way infinite binary trees and the contraction method," Mathematics and computer science II, Eds. B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem, Trends in Mathematics, 393-414. Birkhäuser, Boston, 2001.
16. D. J. Kleitman, "On an extremal property of antichains in partial orders. The LYM property and some of its implications and applications," Combinatorics, Eds. M. Hall and J. van Lint, Math Centre Tracts 56, 77-90. Mathematical Centre, Amsterdam, 1974.
17. D. E. Knuth, The art of computer programming, Addison-Wesley, Reading, MA, 1968, Volume 1.
18. V. F. Kolchin, Random mappings, Optimization Software, New York, 1986 (translated from Slučajneye Otobraženija Nauka, Moscow, 1984).
19. G. F. Lawler, The infinite self-avoiding walk in high dimensions, Ann Probab 17 (1989), 1367-1376.
20. M. Lothaire, Combinatorics on words. Encyclopedia of Mathematics and Its Applications 17, Addison-Wesley, Reading, MA, 1983.
21. R. Lyons, R. Pemantle, and Y. Peres, Conceptual proofs of L log L criteria for mean behavior of branching processes, Ann Probab 23(3) (1995), 1125-1138.
22. N. Madras and G. Slade, The self-avoiding walk, Birkhäuser, Boston, 1993.
23. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, 2nd edition, Academic Press, New York, 1978.
24. J. Pitman, Enumerations of trees and forests related to branching processes and random walks, Technical Report No. 482, University of California, Berkeley, 1997.
25. B. M. I. Rands and D. J. A. Welsh, Animals, trees and renewal sequences, J Appl Math 27 (1981), 1-17.
26. B. M. I. Rands and D. J. A. Welsh, Animals, trees and renewal sequences: corrigendum, J Appl Math 28 (1982), 107.
27. G. N. Raney, Functional composition patterns and power series reversion, Trans Amer Math Soc 94 (1960), 441-451.
28. R. Sedgewick and P. Flajolet, Introduction to analysis of algorithms, Addison-Wesley, Reading, MA, 1996.
29. R. Sprugnoli, The generation of binary trees as a numerical problem, J ACM 39(2) (1992), 317-327.
30. R. P. Stanley, Enumerative combinatorics, Cambridge University Press, Cambridge, 1998, Volume II.