Coalescent Random Forests
暂无分享,去创建一个
[1] George Bruce Halsted,et al. The Collected Mathematical Papers of Arthur Cayley , 1899 .
[2] E. Rideal,et al. The Kinetics of Polymerization , 1937, Nature.
[3] L. E. Clarke. On Cayley's Formula for Counting Trees , 1958 .
[4] B. Harris. PROBABILITY DISTRIBUTIONS RELATED TO RANDOM MAPPINGS , 1960 .
[5] O. Wing. Enumeration of Trees , 1963 .
[6] Stephen Glicksman. On the representation and enumeration of trees , 1963 .
[7] John Riordan,et al. Forests of labeled trees , 1968 .
[8] J. Kingman. Random Processes , 2019, Nature.
[9] J. Moon. Counting labelled trees , 1970 .
[10] John W. Moon. A problem on random trees , 1971 .
[11] M. Gordon,et al. On the number of distinct orderings of a vertex-labeled graph when rooted on different vertices , 1971 .
[12] Andrew Chi-Chih Yao,et al. On the average behavior of set merging algorithms (Extended Abstract) , 1976, STOC '76.
[13] V. F. Kolchin. Branching processes, random trees, and a generalized scheme of arrangements of particles , 1977 .
[14] Ju L Pavlov. LIMIT THEOREMS FOR THE NUMBER OF TREES OF A GIVEN SIZE IN A RANDOM FOREST , 1977 .
[15] A. A Lushnikov,et al. Coagulation in finite systems , 1978 .
[16] Donald E. Knuth,et al. The Expected Linearity of a Simple Equivalence Algorithm , 1978, Theor. Comput. Sci..
[17] Yu. L. Pavlov. The Asymptotic Distribution of Maximum Tree Size in a Random Forest , 1978 .
[18] C. J-F,et al. THE COALESCENT , 1980 .
[19] M. Schreckenberg,et al. Exact solutions for random coagulation processes , 1985 .
[20] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Boris G. Pittel,et al. On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.
[22] Tomasz Luczak,et al. Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.
[23] David Aldous,et al. A Random Tree Model Associated with Random Graphs , 1990, Random Struct. Algorithms.
[24] J. V. Pulé,et al. On Lushnikov's model of gelation , 1990 .
[25] David Aldous,et al. The Continuum Random Tree III , 1991 .
[26] D. Aldous. Stochastic Analysis: The Continuum random tree II: an overview , 1991 .
[27] J. V. Pulé,et al. Polymers and random graphs , 1991 .
[28] Boris G. Pittel,et al. Components of Random Forests , 1992, Combinatorics, Probability and Computing.
[29] J. Pitman,et al. Size-biased sampling of Poisson point processes and excursions , 1992 .
[30] Jim Pitman,et al. Arcsine Laws and Interval Partitions Derived from a Stable Subordinator , 1992 .
[31] Mihael Perman,et al. Order statistics for jumps of normalised subordinators , 1993 .
[32] Jim Pitman,et al. Brownian bridge asymptotics for random mappings , 1992, Advances in Applied Probability.
[33] R. Sheth. Merging and hierarchical clustering from an initially Poisson distribution , 1995 .
[34] Svante Janson,et al. The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph , 1995, Random Struct. Algorithms.
[35] Peter W. Shor,et al. A New Proof of Cayley's Formula for Counting Labeled Trees , 1995, J. Comb. Theory, Ser. A.
[36] Galton-Watson branching processes and the growth of gravitational clustering , 1996, astro-ph/9602112.
[37] Boris G. Pittel,et al. A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree , 1996, Random Struct. Algorithms.
[38] J. Pitman. The asymptotic behavior of the Hurwitz binomial distribution , 1997 .
[39] J. Pitman,et al. The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator , 1997 .
[40] Jim Pitman. Abel-Cayley-Hurwitz multinomial expansions associated with random mappings, forests, and subsets , 1997 .
[41] J. Pitman,et al. Coagulation and branching process models of gravitational clustering , 1997 .
[42] Jim Pitman. The Multinomial Distribution on Rooted Labeled Forests , 1997 .
[43] David Aldous,et al. Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .
[44] Jim Pitman,et al. Enumerations of trees and forests related to branching processes and random walks , 1997, Microsurveys in Discrete Probability.
[45] Jim Pitman,et al. The standard additive coalescent , 1998 .
[46] CoalescenceDavid J. Aldous. Stochastic Coalescence , 1998 .
[47] Jim Pitman,et al. Construction of markovian coalescents , 1998 .
[48] J. Pitman. Coalescents with multiple collisions , 1999 .