Related papers: On a ternary coalescent process
Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning…
We consider a three dimensional system consisting of a large number of small spherical particles, distributed in a range of sizes and heights (with uniform distribution in the horizontal direction). Particles move vertically at a…
In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that land on an occupied site merge with the…
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…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…
In this paper, we study additive coalescents. Using their representation as fragmentation processes, we prove that the law of a large class of eternal additive coalescents is absolutely continuous with respect to the law of the standard…
We introduce and analyse a class of fragmentation-coalescence processes defined on finite systems of particles organised into clusters. Coalescent events merge multiple clusters simultaneously to form a single larger cluster, while…
We introduce and analyze a novel type of coalescent processes called cross-multiplicative coalescent that models a system with two types of particles, $A$ and $B$. The bonds are formed only between the pairs of particles of opposite types…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We consider the compact space of pairs of nested partitions of $\mathbb N$, where by analogy with models used in molecular evolution, we call "gene partition" the finer partition and "species partition" the coarser one. We introduce the…
We study three basic diffusion-controlled reaction processes -- annihilation, coalescence, and aggregation. We examine the evolution starting with the most natural inhomogeneous initial configuration where a half-line is uniformly filled by…
We study infinite systems of particles which undergo coalescence and fragmentation, in a manner determined solely by their masses. A pair of particles having masses $x$ and $y$ coalesces at a given rate $K(x,y)$. A particle of mass $x$…
We present some aspects of the so-called additive coalescence, with a focus on its connections with random trees, Brownian excursion, certain bridges with exchangeable increments, L\'evy processes, and sticky particle systems.
This paper studies systems of particles following independent random walks and subject to annihilation, binary branching, coalescence, and deaths. In the case without annihilation, such systems have been studied in our 2005 paper…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
We study statistical properties of a one dimensional infinite system of coalescing particles. Each particle moves with constant velocity $\pm v$ towards its closest neighbor and merges with it upon collision. We propose a mean-field theory…
We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…
Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…
Binary particle coagulation can be modelled as the repeated random process of the combination of two particles to form a third. The kinetics can be represented by population rate equations based on a mean field assumption, according to…