A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Coalescents With Multiple Collisions
1999
Annals of Probability
For each finite measure on 0 1 , a coalescent Markov process, with state space the compact set of all partitions of the set of positive integers, is constructed so the restriction of the partition to each finite subset of is a Markov chain with the following transition rates: when the partition has b blocks, each k-tuple of blocks is merging to form a single block at rate 1 0 x k−2 1 − x b−k dx . Call this process a -coalescent. Discrete measure-valued processes derived from the -coalescent
doi:10.1214/aop/1022874819
fatcat:2b2bckx2szedtb3fjti2a6d3ju