相关论文: Minimal clade size in the Bolthausen-Sznitman coal…
This article shows the asymptotics of distributions of various functionals of the Beta$(2-\alpha,\alpha)$ $n$-coalescent process with $1<\alpha<2$ when $n$ goes to infinity. This process is a Markov process taking {values} in the set of…
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to [n]: we show…
For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…
We work in the context of the infinitely many alleles model. The allelic partition associated with a coalescent process started from n individuals is obtained by placing mutations along the skeleton of the coalescent tree; for each…
The Mittag-Leffler process $X=(X_t)_{t\ge 0}$ is introduced. This Markov process has the property that its marginal random variables $X_t$ are Mittag-Leffler distributed with parameter $e^{-t}$, $t\in [0,\infty)$, and the semigroup…
A recursion for the joint moments of the external branch lengths for coalescents with multiple collisions ($\Lambda$-coalescents) is provided. This recursion is used to derive asymptotic results as the sample size $n$ tends to infinity for…
Consider a population of fixed size that evolves over time. At each time, the genealogical structure of the population can be described by a coalescent tree whose branches are traced back to the most recent common ancestor of the…
We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is…
We study tree lengths in $\Lambda$-coalescents without a dust component from a sample of $n$ individuals. For the total length of all branches and the total length of all external branches we present laws of large numbers in full…
For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…
Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the $\beta(3/2,1/2)$-coalescent. By considering a pruning procedure on…
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 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 the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…
$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…
The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…
Boltzmann machine is a powerful tool for modeling probability distributions that govern the training data. A thermal equilibrium state is typically used for Boltzmann machine learning to obtain a suitable probability distribution. The…
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…
We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…
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…