The multiplicative coalescent is a Markov process taking values in ordered @math . It is a mean-field process in which any pair of blocks coalesces at rate proportional to the product of their masses. In Aldous and Limic (1998) each extreme eternal version @math of the multiplicative coalescent was described in three different ways. One of these specifications matches the (marginal) law of @math to that of the ordered excursion lengths above past minima of @math , where @math is a certain Levy-type process which (modulo shift and scaling) has infinitesimal drift @math at time @math . Using a modification of the breadth-first-walk construction from Aldous (1997) and Aldous and Limic (1998), and some new insight from the thesis by Uribe (2007), this work settles an open problem (3) from Aldous (1997), in the more general context of Aldous and Limic (1998). Informally speaking, @math is entirely encoded by @math , and contrary to Aldous' original intuition, the evolution of time for @math does correspond to the linear increase in the constant part of the drift of @math . In the "standard multiplicative coalescent" context of Aldous (1997), this result was first announced by Armendariz in 2001, and obtained in a recent preprint by Broutin and Marckert, who simultaneously account for the process of excess edge counts (or marks). The novel argument presented here is based on a sequence of relatively elementary observations. Some of its components (for example, the new dynamic random graph construction via "simultaneous" breadth-first walks) are of independent interest, and may be useful for obtaining more sophisticated asymptotic results on near critical random graphs and related processes.
The two nice graphical constructions for coalescents with masses were discovered early on: by Aldous in @cite_14 for the multiplicative case, and almost simultaneously by Aldous and Pitman @cite_51 for the additive case (here any pair of blocks of mass @math and @math merges at rate @math ). The analogue of @cite_10 in the additive coalescent case is again due to Aldous and Pitman @cite_12 . No nice graphical construction for another (merging rate) coalescent with masses seems to have been found since. For studies of stochastic coalescents with general kernel see Evans and Pitman @cite_19 and Fournier @cite_55 @cite_15 . Interest for probabilistic study of related Smoluchowski's equations (with general merging kernels) was also incited by @cite_38 , see for example Norris @cite_54 , Jeon @cite_2 , then Fournier and Lauren c ot @cite_13 @cite_17 and Bertoin @cite_35 for more recent, and Merle and Normand @cite_46 @cite_40 for even more recent developments. All of the above mentioned models are mean-field . See for example @cite_0 @cite_20 @cite_18 for studies of (mass-less) coalescent models in the presence of spatial structure.
@cite_13 @cite_38 @cite_35 @cite_14 @cite_18 @cite_46 @cite_55 @cite_54 @cite_0 @cite_19 @cite_40 @cite_2 @cite_51 @cite_15 @cite_20 @cite_10 @cite_12 @cite_17
1747067133 2065794571 1970474336 1986567569
We revisit the discrete additive and multiplicative coalescents, starting with n particles with unit mass. These cases are known to be related to some “combinatorial coalescent processes”: a time reversal of a fragmentation of Cayley trees or a parking scheme in the additive case, and the random graph process ((G(n,p))_p ) in the multiplicative case. Time being fixed, encoding these combinatorial objects in real-valued processes indexed by the line is the key to describing the asymptotic behaviour of the masses as (n + ). We propose to use the Prim order on the vertices instead of the classical breadth-first (or depth-first) traversal to encode the combinatorial coalescent processes. In the additive case, this yields interesting connections between the different representations of the process. In the multiplicative case, it allows one to answer to a stronger version of an open question of Aldous (Ann Probab 25:812–854, 1997): we prove that not only the sequence of (rescaled) masses, seen as a process indexed by the time ( ), converges in distribution to the reordered sequence of lengths of the excursions above the current minimum of a Brownian motion with parabolic drift ((B_t+ t - t^2 2, t 0) ), but we also construct a version of the standard augmented multiplicative coalescent of (Probab Theory Relat, 2013) using an additional Poisson point process. k−2 � 1 − xb−k � � dx� . Call this process a � -coalescent. Discrete measure-valued processes derived from the � -coalescent model a system of masses undergoing coalescent collisions. Kingman's coalescent, which has numerous applications in population genetics, is the δ0-coalescent for δ0 a unit mass at 0. The coalescent recently derived by Bolthausen and Sznit- man from Ruelle's probability cascades, in the context of the Sherrington- Kirkpatrick spin glass model in mathematical physics, is the U-coalescent for U uniform on � 0� 1� .F or� = U, and whenever an infinite number of masses are present, each collision in a � -coalescent involves an infinite number of masses almost surely, and the proportion of masses involved exists as a limit almost surely and is distributed proportionally to � . The two-parameter Poisson-Dirichlet family of random discrete distributions derived from a stable subordinator, and corresponding exchangeable ran- dom partitions ofgoverned by a generalization of the Ewens sampling formula, are applied to describe transition mechanisms for processes of coalescence and fragmentation, including the U-coalescent and its time reversal. 1. Introduction. Markovian coalescent models for the evolution of a sys- tem of masses by a random process of binary collisions were introduced by Marcus (29) and Lushnikov (28). See (3) for a recent survey of the scientific lit- erature of these models and their relation to Smoluchowski's mean-field theory of coagulation phenomena. Evans and Pitman (15) gave a general framework for the rigorous construction of partition-valued and discrete measure-valued coalescent Markov processes allowing infinitely many massses and treated the binary coalescent model where each pair of masses x and y is subject to a coa- lescent collision at rate κ� xyfor a suitable rate kernel κ. This paper studies a family of partition-valued Markov processes, with state space the compact set of all partitions of � �= � 1� 2 ���� � , such that the restriction of the partition to each finite subset ofis a Markov chain with transition rates of a simple form determined by the moments of a finite measureon the unit interval. The case � = δ 0 , a unit mass at 0, is Kingman's coalescent in which every Author(s): Aldous, DJ; Pittel, B | Abstract: A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1 n, is studied. The detailed picture of emergence of giant components with O(n2 3) vertices is shown to be the same as in the Erdos-Renyi graph process with the number of vertices fixed at n at the start. A major difference is that now the transition occurs about a time t = π 2, rather than t = 1. The proof has three ingredients. The size of the largest component in the subcritical phase is bounded by comparison with a certain multitype branching process. With this bound at hand, the growth of the sum-of-squares and sum-of-cubes of component sizes is shown, via martingale methods, to follow closely a solution of the Smoluchowsky-type equations. The approximation allows us to apply results of Aldous [Brownian excursions, critical random graphs and the multiplicative coalescent, Ann Probab 25 (1997), 812-854] on emergence of giant components in the multiplicative coalescent, i.e., a nonuniform random graph process. © 2000 John Wiley a Sons, Inc. Random Struct. Alg., 17, 79-102, 2000. Regard an element of the set Δ := (x 1 , x 2 , . . .): x 1 ≥ x 2 ≥ ⋯ ≥ 0, ∑ i x i = 1 as a fragmentation of unit mass into clusters of masses x i . The additive coalescent of Evans and Pitman is the Δ-valued Markov process in which pairs of clusters of masses x i , x j merge into a cluster of mass x i + x j at rate x i + x j . They showed that a version (X ∞ (t), -∞ < t < ∞) of this process arises as a n → ∞ weak limit of the process started at time -1 2 log n with n clusters of mass 1 n. We show this standard additive coalescent may be constructed from the continuum random tree of Aldous by Poisson splitting along the skeleton of the tree. We describe the distribution of X∞(t) on Δ at a fixed time t. We show that the size of the cluster containing a given atom, as a process in t, has a simple representation in terms of the stable subordinator of index 1 2. As t → -∞, we establish a Gaussian limit for (centered and normalized) cluster sizes and study the size of the largest cluster.