In this paper we give a new example of duality between fragmentation and coagulation operators. Consider the space of partitions of mass (i.e., decreasing sequences of nonnegative real numbers whose sum is 1) and the two-parameter family of Poisson--Dirichlet distributions $\operatorname {PD}(α,θ)$ that take values in this space. We introduce families of random fragmentation and coagulation operators $\mathrm {Frag}_α$ and $\mathrm {Coag}_{α,θ}$, respectively, with the following property: if the input to $\mathrm {Frag}_α$ has $\operatorname {PD}(α,θ)$ distribution, then the output has $\operatorname {PD}(α,θ+1)$ distribution, while the reverse is true for $\mathrm {Coag}_{α,θ}$. This result may be proved using a subordinator representation and it provides a companion set of relations to those of Pitman between $\operatorname {PD}(α,θ)$ and $\operatorname {PD}(αβ,θ)$. Repeated application of the $\mathrm {Frag}_α$ operators gives rise to a family of fragmentation chains. We show that these Markov chains can be encoded naturally by certain random recursive trees, and use this representation to give an alternative and more concrete proof of the coagulation--fragmentation duality.
We establish the central limit theorem for the number of groups at the equilibrium of a coagulation-fragmentation process given by a parameter function with polynomial rate of growth. The result obtained is compared with the one for random combinatorial structures obeying the logarithmic condition.
We establish a characterization of coagulation-fragmentation processes, such that the induced birth and death processes depicting the total number of groups at time $t\ge 0$ are time homogeneous. Based on this, we provide a characterization of mean-field Gibbs coagulation-fragmentation models, which extends the one derived by Hendriks et al. As a by- product of our results, the class of solvable models is widened and a question posed by N. Berestycki and Pitman is answered, under restriction to mean-field models.
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence of finite sizes of components. The multiplicative measures depict component spectra of random structures, the equilibrium of classic models of statistical mechanics and stochastic processes of coagulation-fragmentation. We then apply Schur's tauberian lemma and some results from additive number theory and enumerative combinatorics, in order to verify the con…
The purpose of this work is to describe a duality between a fragmentation associated to certain Dirichlet distributions and a natural random coagulation. The dual fragmentation and coalescent chains arising in this setting appear in the description of the genealogy of Yule processes.
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, $a_k\sim Ck^{p-1}, k\to\infty, p>0$,where $C$ is a positive constant. The measures considered are associated with reversible coagulation-fragmentation processes and certain combinatorial structures, known as assemblies. We prove the functional central limit theorem for the fluctuations of a scaled random partition from its limit shape. We demonstrate that when the component size passes beyond the threshold value, the independence of numbe…
First we establish explosion criteria for jump processes with an arbitrary locally compact separable metric state space. Then these results are applied to two stochastic coagulation-fragmentation models--the direct simulation model and the mass flow model. In the pure coagulation case, there is almost sure explosion in the mass flow model for arbitrary homogeneous coagulation kernels with exponent bigger than 1. In the case of pure multiple fragmentation with a continuous size space, explosion occurs in both models provided the total fragmentation rate grows sufficiently fast at zero. However,…
We consider the class of exchangeable fragmentation-coagulation (EFC) processes where coagulations are multiple and not simultaneous, as in a $Λ$-coalescent, and fragmentation dislocates at finite rate an individual block into sub-blocks of infinite size. We call these partition-valued processes, simple EFC processes, and study the question whether such a process, when started with infinitely many blocks, can visit partitions with a finite number of blocks or not. When this occurs, one says that the process comes down from infinity. We introduce two sharp parameters $θ_{\star}\leq θ^{\star}\in…
A hierarchical system of equations is introduced to describe dynamics of `sizes' of infinite clusters which coagulate and fragmentate with homogeneous rates of certain form. We prove that this system of equations is solved weakly by correlation measures for stochastic dynamics of interval partitions evolving according to some split-merge transformations. Regarding those processes, a sufficient condition for a distribution to be reversible is given. Also, an asymptotic result for properly rescaled processes is shown to obtain a solution to a nonlinear equation called the coagulation-fragmentati…
Pitman~(1999) describes a duality relationship between fragmentation and coagulation operators. An explicit relationship is described for the two-parameter Poisson-Dirichlet laws, with parameters {\footnotesize $(α,θ)$} and $(β,θ/α)$, wherein $PD(α, θ)$ is coagulated by $PD(β,θ/α)$ for $0<α<1$, $0 \leqβ<1$ and $-β<θ/α$. This remarkable explicit agreement was obtained by combinatorial methods via exchangeable partition probability functions~(EPPF). This work discusses an alternative analysis which can feasibly extend the characterizations above to more general models of $PD(α,θ)$ coagulated wit…
We consider a coagulation multiple-fragmentation equation, which describes the concentration $c\_t(x)$ of particles of mass $x \in (0,\infty)$ at the instant $t \geq 0$ in a model where fragmentation and coalescence phenomena occur. We study the existence and uniqueness of measured-valued solutions to this equation for homogeneous-like kernels of homogeneity parameter $λ\in (0,1]$ and bounded fragmentation kernels, although a possibly infinite total fragmentation rate, in particular an infinite number of fragments, is considered. This work relies on the use of a Wasserstein-type distance, whic…
The isotropic 4-wave kinetic equation is considered in its weak formulation using model (simplified) homogeneous kernels. Existence and uniqueness of solutions is proven in a particular setting where the kernels have a rate of growth at most linear. We also consider finite stochastic particle systems undergoing instantaneous coagulation- fragmentation phenomena and give conditions in which this system approximates the solution of the equation (mean-field limit).
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of the equilibrium measure for a wide class of parameter functions of the process. This formula proves the conjecture stated in [dgg] for the above class of processes. The method used goes back to A.Khintchine.
Coagulation-fragmentation processes describe the stochastic association and dissociation of particles in clusters. Cluster dynamics with cluster-cluster interactions for a finite number of particles has recently attracted attention especially in stochastic analysis and statistical physics of cellular biology, as novel experimental data is now available, but their interpretation remains challenging.} We derive here probability distribution functions for clusters that can either aggregate upon binding to form clusters of arbitrary sizes or a single cluster can dissociate into two sub-clusters. U…
We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $β_m$ (if the sampled parts are distinct) or splitting the part with probability $β_s$ according to a law $σ$ (if the same part was sampled twice). We characterize invariant probability measures for such chains. In particular, if $σ$ is the uniform measure then the Poisson-Dirichlet law is an invariant probability measure, and it is unique within a suitably defined class of ``analytic'' invarian…
Gibbs partitions of the integers generated by stable subordinators of index $α\in(0,1)$ form remarkable classes of random partitions where in principle much is known about their properties, including practically effortless obtainment of otherwise complex asymptotic results potentially relevant to applications in general combinatorial stochastic processes, random tree/graph growth models and Bayesian statistics. This class includes the well-known models based on the two-parameter Poisson-Dirichlet distribution which forms the bulk of explicit applications. This work continues efforts to provide…
We introduce a reversible Markovian coagulation-fragmentation process on the set of partitions of $\{1,\ldots,L\}$ into disjoint intervals. Each interval can either split or merge with one of its two neighbors. The invariant measure can be seen as the Gibbs measure for a homogeneous pinning model \cite{cf:GBbook}. Depending on a parameter $λ$, the typical configuration can be either dominated by a single big interval (delocalized phase), or be composed of many intervals of order $1$ (localized phase), or the interval length can have a power law distribution (critical regime). In the three case…
Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course that $A$, or $B$, is not empty). The number of balls in $B$ after $n$ steps is of order $\sqrt n$, and this number remains essentially the same after $\sqrt n$ further steps. Observe that each ball in the urn $B$ after $n$ steps has a probability bounded away from $0$ and $1$ to be placed back in the urn $A$ after $\sqrt n$ further steps. So, even though the …
We consider the exchangeable fragmentation-coagulation (EFC) processes, where the coagulations are multiple and not simultaneous, as in a $Λ$-coalescent, and the fragmentations dislocate at finite rate an individual block into sub-blocks of infinite size. Sufficient conditions are found for the block-counting process to explode (i.e. to reach $\infty$) or not and for infinity to be an exit boundary or an entrance boundary. In a case of regularly varying fragmentation and coagulation mechanisms, we find regimes where the boundary $\infty$ can be either an exit, an entrance or a regular boundary…
We develop a unified approach to the problem of clustering in the three different fields of applications, as indicated in the title the paper. The approach is based on Khintchine's probabilistic method that grew out of the Darwin-Fawler method in statistical physics. Our main result is the derivation of asymptotic formulae for probabilities of clusters (= groups) of certain sizes as the number of particles goes to infinity. Based on these formulae we prove the zero-one law for the distribution of the largest cluster and establish the threshold function in the phase transition from 0 to 1 in th…
We investigate the connection between two classical models of phase transition phenomena, the (discrete size) stochastic Becker-Döring, a continous time Markov chain model, and the (continuous size) deterministic Lifshitz-Slyozov model, a nonlinear transport partial differential equation. For general coefficients and initial data, we introduce a scaling parameter and prove that the empirical measure associated to the stochastic Becker-Döring system converges in law to the weak solution of the Lifshitz-Slyozov equation when the parameter goes to 0. Contrary to previous studies, we use a weak to…
We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $Π$(t) of N into blocks of connected vertices. Despite the lack of exchangeability, just like for an exchangeable fragmentation process, the process $Π$ is Markovian with transitions determined by a splitting rates measure r. However, somewhat surprisingly, r fails to fulfill the usual integrability condition for the dislocation measure of exchangeable fragmentations. We further observe that a time-dependent …
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate proportional to their sizes (isolation of connected component). A phase transition occurs when the isolation is able to stop the growth fragmentation process and cause extinction. When the process survives, the number of clusters increases exponentially and we prove that the normalized empirical measure of clusters a.s. converges to a limit law on recursive …
These notes give a mathematical introduction to two seemingly unrelated topics: (i) quantum spin systems and their cycle and loop representations, due to Tóth and Aizenman-Nachtergaele; (ii) coagulation-fragmentation stochastic processes. These topics are nonetheless related, as we argue that the lengths of cycles and loops satisfy an effective coagulation-fragmentation process. This suggests that their joint distribution is Poisson-Dirichlet. These ideas are far from being proved, but they are backed by several rigorous results, notably of Dyson-Lieb-Simon and Schramm.
We consider the area $A=\int_0^{\infty}\left(\sum_{i=1}^{\infty} X_i(t)\right) \d t$ of a self-similar fragmentation process $\X=(\X(t), t\geq 0)$ with negative index. We characterize the law of $A$ by an integro-differential equation. The latter may be viewed as the infinitesimal version of a recursive distribution equation that arises naturally in this setting. In the case of binary splitting, this yields a recursive formula for the entire moments of $A$ which generalizes known results for the area of the Brownian excursion.
We introduce and study an infinite random triangulation of the unit disk that arises as the limit of several recursive models. This triangulation is generated by throwing chords uniformly at random in the unit disk and keeping only those chords that do not intersect the previous ones. After throwing infinitely many chords and taking the closure of the resulting set, one gets a random compact subset of the unit disk whose complement is a countable union of triangles. We show that this limiting random set has Hausdorff dimension $β^*+1$, where $β^*=(\sqrt{17}-3)/2$, and that it can be described …
We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescence in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain under an appropriate rescaling when N tends to infinity a well-known binary coalescence, the so-called standard additive coalescent.
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is asymptotically normal in some cases but not in others, depending on the position of roots of a certain characteristic equation. This parallels the behaviour of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and add further details. The proof uses the contraction method…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related structures. We prove the existence of these CRTs as a new application of the fixpoint method for recursive distribution equations formalised in high generality by Aldous and Bandyopadhyay. We apply this recursive method to show the convergence to CRTs of various tree growth processes. We note alternative constructions of existing self-similar CRTs in the sense of…
