Related papers: On the time to absorption in $\Lambda$-coalescents

We study some aspects of the absorption time of the Beta$(a,b)$-Coalescent starting with $n$ blocks. More precisely, when $a>1$, the absorption time is known to converge to infinity as $n$ goes to infinity, and we prove that it satisfies a…

We consider the number of blocks involved in the last merger of a $\Lambda$-coalescent started with $n$ blocks. We give conditions under which, as $n \to \infty$, the sequence of these random variables a) is tight, b) converges in…

We provide scaling limits for the block counting process and the fixation line of $\Lambda$-coalescents as the initial state $n$ tends to infinity under the assumption that the measure $\Lambda$ on $[0,1]$ satisfies…

Consider a $\Lambda$-coalescent that comes down from infinity (meaning that it starts from a configuration containing infinitely many blocks at time 0, yet it has a finite number $N_t$ of blocks at any positive time $t>0$). We exhibit a…

We examine the total number of collisions $C_n$ in the $\Lambda$-coalescent process which starts with $n$ particles. A linear growth and a stable limit law for $C_n$ are shown under the assumption of a power-like behaviour of the measure…

We consider the lambda-coalescent processes with positive frequency of singleton clusters. The class in focus covers, for instance, the beta$(a,b)$-coalescents with $a>1$. We show that some large-sample properties of these processes can be…

We consider standard $\La$-coalescents (or coalescents with multiple collisions) with a non-trivial "Kingman part". Equivalently, the driving measure $\Lambda$ has an atom at $0$; $\Lambda(\{0\})=c>0$. It is known that all such coalescents…

Consider a standard ${\Lambda }$-coalescent that comes down from infinity. Such a coalescent starts from a configuration consisting of infinitely many blocks at time $0$, but its number of blocks $N_t$ is a finite random variable at each…

In this paper we obtain scaling limits of $\Lambda$-coalescents near time zero under a regularly varying assumption. In particular this covers the case of Kingman's coalescent and beta coalescents. The limiting processes are coalescents…

For a finite measure $\varLambda$ on $[0,1]$, the $\varLambda$-coalescent is a coalescent process such that, whenever there are $b$ clusters, each $k$-tuple of clusters merges into one at rate…

Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…

The block counting process with initial state $n$ counts the number of blocks of an exchangeable coalescent ($\Xi$-coalescent) restricted to a sample of size $n$. This work provides scaling limits for the block counting process of regular…

We quantify the manner in which the beta coalescent $\Pi=\{ \Pi(t), t\geq 0\},$ with parameters $a\in (0, 1),$ $b>0,$ comes down from infinity. Approximating $\Pi$ by its restriction $\Pi^n$ to $[n]\:= \{1, \ldots, n\},$ the suitably…

The general model of coagulation is considered. For basic classes of unbounded coagulation kernels the central limit theorem (CLT) is obtained for the fluctuations around the dynamic law of large numbers (LLN). A rather precise rate of…

We present approximation methods which lead to law of large numbers and fluctuation results for functionals of $\Lambda$-coalescents, both in the dust-free case and in the case with a dust component. Our focus is on the tree length (or…

An important property of Kingman's coalescent is that, starting from a state with an infinite number of blocks, over any positive time horizon, it transitions into an almost surely finite number of blocks. This is known as `coming down from…

We prove a law of large numbers and a central limit theorem for a tagged particle in a symmetric simple exclusion process in the one-dimensional lattice with variable diffusion coefficient. The scaling limits are obtained from a similar…

Consider a multitype coalescent process in which each block has a colour in $\{1,\ldots,d\}$. Individual blocks may change colour, and some number of blocks of various colours may merge to form a new block of some colour. We show that if…

The $\X$-coalescent processes were initially studied by M\"ohle and Sagitov (2001), and introduced by Schweinsberg (2000) in their full generality. They arise in the mathematical population genetics as the complete class of scaling limits…

We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…