Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

Abstract. Regard an element of the set of ranked discrete distributions Δ := {(x1, x2,…):x1≥x2≥…≥ 0, ∑ixi = 1} as a fragmentation of unit mass into clusters of masses xi. The additive coalescent is the Δ-valued Markov process in which pairs of clusters of masses {xi, xj} merge into a cluster of mass xi + xj at rate xi + xj. Aldous and Pitman (1998) showed that a version of this process starting from time −∞ with infinitesimally small clusters can be constructed from the Brownian continuum random tree of Aldous (1991, 1993) by Poisson splitting along the skeleton of the tree. In this paper it is shown that the general such process may be constructed analogously from a new family of inhomogeneous continuum random trees.

[1]  David Aldous,et al.  Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .

[2]  David Aldous,et al.  The Continuum Random Tree III , 1991 .

[3]  E. Dynkin.  Sufficient Statistics and Extreme Points , 1978 .

[4]  Andrew Chi-Chih Yao,et al.  On the average behavior of set merging algorithms (Extended Abstract) , 1976, STOC '76.

[5]  J. Pitman,et al.  Coagulation and branching process models of gravitational clustering , 1997 .

[6]  Jim Pitman,et al.  Construction of markovian coalescents , 1998 .

[7]  Jim Pitman.  Abel-Cayley-Hurwitz multinomial expansions associated with random mappings, forests, and subsets , 1997 .

[8]  Jim Pitman,et al.  A family of random trees with random edge lengths , 1999 .

[9]  L. Oversteegen,et al.  A topological characterization of -trees , 1990 .

[10]  John O’M. Bockris,et al.  Heavy quark potential and the phase transitions in the continuum theory at finite temperature , 1994 .

[11]  L. Oversteegen,et al.  A Topological Characterization of R-Trees , 1990 .

[12]  Jim Pitman,et al.  A family of random trees with random edge lengths , 1999, Random Struct. Algorithms.

[13]  Jean Bertoin,et al.  A fragmentation process connected to Brownian motion , 2000 .

[14]  J. Pitman.  Coalescent Random Forests , 1997 .

[15]  Jim Pitman,et al.  Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities , 2000 .

[16]  D. Aldous.  Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists , 1999 .

[17]  J. Kingman.  The Representation of Partition Structures , 1978 .

[18]  Jim Pitman,et al.  The standard additive coalescent , 1998 .

[19]  J. Pitman.  The SDE solved by local times of a brownian excursion or bridge derived from the height profile of a random tree or forest , 1999 .

[20]  Guy Louchard,et al.  Phase Transition for Parking Blocks, Brownian Excursion and Coalescence , 2022 .

[21]  David Aldous,et al.  The Entrance Boundary of the Multiplicative Coalescent , 1998 .