Coalescent Random Forests

Journal of Combinatorial Theory. Series A

Volumn 85, Issue 2, 1999, Pages 165-193

  Pitman, Jim ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033074514     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1998.2919     Document Type: Article

References (65)

1. Aldous D. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25:1997;812-854.
2. Aldous D., Pitman J. Brownian bridge asymptotics for random mappings. Random Struct. Algorithms. 5:1994;487-512.
3. Aldous D. J. A random tree model associated with random graphs. Random Struct. Algorithms. 1:1990;383-402.
4. Aldous D. J. The continuum random tree I. Ann. Probab. 19:1991;1-28.
5. Aldous D. J. The continuum random tree II: An overview. Barlow M. T., Bingham N. H. Stochastic Analysis. 1991;23-70 Cambridge University Press, Cambridge.
6. Aldous D. J. The continuum random tree III. Ann. Probab. 21:1993;248-289.
7. Aldous D. J. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25:1997;812-854.
8. D. J. Aldous, Deterministic and stochastic models for coalescence: a review of the mean-field theory for probabilists, Bernoulli.
9. Aldous D. J., Pitman J. The standard additive coalescent. technical report. 1997.
10. Bollobás B. Random Graphs. 1985;Academic Press, London.
11. Broder A. Generating random spanning trees. Proc. 30'th IEEE Symp. Found. Comp. Sci. 1989;. p. 442-447.
12. Buffet E., Pulé J. V. On Lushnikov's model of gelation. J. Statist. Phys. 58:1990;1041-1058.
13. Buffet E., Pulé J. V. Polymers and random graphs. J. Statist. Phys. 64:1991;87-110.
14. Cayley A. A theorem on trees. Quart. J. Pure Appl. Math. 23:1889;376-378.
15. Clarke L. E. On Cayley's formula for counting trees. J. London Math. Soc. 33:1958;471-474.
16. Consul P. C. A simple urn model dependent upon a predetermined strategy. Sankhya Ser. B. 36:1974;391-399.
17. Dénes J. On a generalization of permutations: some properties of transformations. Permutations: Actes du colloque sur les permutations; Paris, Univ. René-Descartes, 10-13 juillet 1972. 1972;Gauthier-Villars, Paris-Bruxelles-Montréal. p. 117-120.
18. Evans S. N., Pitman J. Construction of Markovian coalescents. Ann. Inst. Henri Poincaré 34:1998;339-383.
19. Glicksman S. On the representation and enumeration of trees. Proc. Camb. Phil. Soc. 59:1963;509-517.
20. Gordon M., Parker T. G., Temple W. B. On the number of distinct orderings of a vertex-labeled graph when rooted on different vertices. J. Comb. Theory. 11:1971;142-156.
21. Harris B. Probability distributions related to random mappings. Ann. Math. Statist. 31:1960;1045-1062.
22. Hendriks E. M., Spouge J. L., Eibl M., Shreckenberg M. Exact solutions for random coagulation processes. Z. Phys. B - Condensed Matter. 58:1985;219-227.
23. Janson S. The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Struct. Algorithms. 7:1995;337-355.
24. Kesten H., Pittel B. A local limit theorem for the number of nodes, the height, and the number of leaves in a critical branching process tree. Random Struct. Algorithms. 8:1996;243-299.
25. Kingman J. F. C. The coalescent. Stochastic Processes Appl. 13:1982;235-248.
26. Knuth D. E., Schonhage A. The expected linearity of a simple equivalence algorithm. Theor. Computer Sci. 6:1978;281-315.
27. Kolchin V. F. Branching processes, random trees, and a generalized scheme of arrangements of particles. Math. Notes Acad. Sci. USSR. 21:1977;386-394.
28. Kolchin V. F. Random Mappings. 1986;Optimization Software, New York.
29. Luczak T. Component behavior near the critical point of the random graph process. Random Struct. Algorithms. 1:1990;287-310.
30. Luczak T., Pittel B. Components of random forests. Combinatorics, Probability Comput. 1:1992;35-52.
31. Lushnikov A. A. Certain new aspects of the coagulation theory. Izv. Atmos. Ocean Phys. 14:1978;738-743.
32. Lushnikov A. A. Coagulation in finite systems. J. Colloid Interface Sci. 65:1978;276-285.
33. R. Lyons, Y. Peres, Probability on Trees and Networks.
34. Marcus A. H. Stochastic coalescence. Technometrics. 10:1968;133-143.
35. Moon J. W. Enumerating labelled trees. Harary F. Graph Theory and Theoretical Physic. 1967;261-272 Academic Press, San Diego.
36. Moon J. W. A problem on random trees. J. Comb. Theory B. 10:1970;201-205.
37. Moon J. W. Various proofs of Cayley's formula for counting trees. Harary F. A Seminar on Graph Theory. 1967;70-78 Holt, Rineharte & Winston, New York.
38. Moon J. W. Counting Labelled Trees. Canadian Mathematical Congress. 1970.
39. Pavlov Yu. L. Limit theorems for the number of trees of a given size in a random forest. Math. USSR Subornik. 32:1977;335-345.
40. Pavlov Yu. L. The asymptotic distribution of maximum tree size in a random forest. Theory Prob. Appl. 22:1977;509-520.
41. Perman M. Order statistics for jumps of normalized subordinators. Stoch. Proc. Appl. 46:1993;267-281.
42. Perman M., Pitman J., Yor M. Size-biased sampling of Poisson point processes and excursions. Probab. Th. Rel. Fields. 92:1992;21-39.
43. Pitman J. Abel-Cayley-Hurwitz multinomial expansions associated with random mappings, forests and subsets. technical report. 1997.
44. Pitman J. Coalescents with multiple collisions. technical report. 1997.
45. Pitman J. The asymptotic behavior of the Hurwitz binomial distribution. technical report. 1997.
46. Pitman J. The multinomial distribution on rooted labeled forests. technical report. 1997.
47. Pitman J. Enumerations of trees and forests related to branching processes and random walks. Aldous D., Propp J. Microsurveys in Discrete Probability. number 41 in DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 1998;163-180 Amer. Math. Soc. Providence.
48. Pitman J., Yor M. Arcsine laws and interval partitions derived from a stable subordinator. Proc. London Math. Soc. (3). 65:1992;326-356.
49. Pitman J., Yor M. The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator. Ann. Probab. 25:1997;855-900.
50. Pittel B. On tree census and the giant component in sparse random graphs. Random Struct. Algorithms. 1:1990;311-342.
51. Prüfer H. Neuer Beweis eines Satzes über Permutationen. Archiv Math. Phys. 27:1918;142-144.
52. Rényi A. Some remarks on the theory of trees. MTA Mat. Kut. Inst. Kozl. 4:1959;73-85.
53. Rényi A. On the enumeration of trees. Guy R., Hanani H., Sauer N., Schonheim J. Combinatorial Structures and Their Applications. 1970;355-360 Gordon and Breach, New York.
54. Riordan J. Combinatorial Identities. 1968;Wiley, New York.
55. Riordan J. Forests of labeled trees. J. Comb. Theory. 5:1968;90-103.
56. Rosenblatt M. Random Processes. 1974;Springer-Verlag, New York.
57. Sheth R. K. Merging and hierarchical clustering from an initially Poisson distribution. Mon. Not. R. Astron. Soc. 276:1995;796-824.
58. Sheth R. K. Galton-Watson branching processes and the growth of gravitational clustering. Mon. Not. R. Astron. Soc. 281:1996;1277-1289.
59. Sheth R. K., Pitman J. Coagulation and branching process models of gravitational clustering. Mon. Not. R. Astron. Soc. 289:1997;66-80.
60. Shor P. W. A new proof of Cayley's formula for counting labelled trees. J. Combin. Theory Ser. A. 71:1995;154-158.
61. Stanley R. Enumerative Combinatorics, Vol. 2. 1996;Cambridge University Press, Cambridge.
62. Stanley R. P. Enumerative Combinatorics, Vol. I. 1986;Wadsworth & Brooks/Cole, Monterey.
63. Takács L. Counting forests. Discrete Math. 84:1990;323-326.
64. Yao A. On the average behavior of set merging algorithms. Proc. 8th ACM Symp. Theory of Computing. 1976;. p. 192-195.
65. Ziff R. M. Kinetics of polymerization. J. Stat. Phys. 23:1980;241-263.