Coalescent random forests

DOI10.1006/jcta.1998.2919zbMath0918.05042OpenAlexW2090026010MaRDI QIDQ1284161

Jim W. Pitman

Publication date: 30 March 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2919

zbMATH Keywords

treeenumerationforestsclustering or coagulation processes

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Random tree-weighted graphs, Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, Gibbs distributions for random partitions generated by a fragmentation process, A conversation with Jim Pitman, Surprising identities for the greedy independent set on Cayley trees, Loop-erased partitioning of a graph: mean-field analysis, A new encoding of coalescent processes: applications to the additive and multiplicative cases, The cut-tree of large Galton-Watson trees and the Brownian CRT, A simple model of trees for unicellular maps, Fires on trees, Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees, The asymptotic distribution of cluster sizes for supercritical percolation on random split trees, A simple formula for the series of constellations and quasi-constellations with boundaries, The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses, Random partitioning over a sparse contingency table, Scaling Limits of Markov-Branching Trees and Applications, The magical Ewens sampling formula, Counting trees using symmetries, A new combinatorial representation of the additive coalescent, The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees, A recursive algorithm for trees and forests, A bijective proof of the Shor recurrence, Asymptotics of trees with a prescribed degree sequence and applications, The fluctuations of the giant cluster for percolation on random split trees, Percolation on random recursive trees, Pointed and multi-pointed partitions of type \(A\) and \(B\), A phase transition in the random transposition random walk, A family of random trees with random edge lengths, A non-increasing tree growth process for recursive trees and applications, Strong laws of large numbers for random forests, Almost Giant Clusters for Percolation on Large Trees with Logarithmic Heights, The standard additive coalescent, Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions, Sizes of the largest clusters for supercritical percolation on random recursive trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting forests
• The continuum random tree. I
• The coalescent
• Size-biased sampling of Poisson point processes and excursions
• The expected linearity of a simple equivalence algorithm
• Branching processes, random trees, and a generalized scheme of arrangements of particles
• Polymers and random graphs
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• The standard additive coalescent
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• Construction of Markovian coalescents
• Coalescents with multiple collisions
• A new proof of Cayley's formula for counting labeled trees
• The continuum random tree. III
• Order statistics for jumps of normalised subordinators
• A problem on random trees
• On the number of distinct orderings of a vertex-labelled graph when rooted on different vertices
• Probability on Trees and Networks
• On Cayley's Formula for Counting Trees
• A random tree model associated with random graphs
• Component behavior near the critical point of the random graph process
• On tree census and the giant component in sparse random graphs
• Arcsine Laws and Interval Partitions Derived from a Stable Subordinator
• The Asymptotic Distribution of Maximum Tree Size in a Random Forest
• LIMIT THEOREMS FOR THE NUMBER OF TREES OF A GIVEN SIZE IN A RANDOM FOREST
• Components of Random Forests
• Brownian bridge asymptotics for random mappings
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree
• Forests of labeled trees
• Probability Distributions Related to Random Mappings
• Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions