Binary sequential representations of random partitions
Young, James E.
Bernoulli, Tome 11 (2005) no. 1, p. 847-861 / Harvested from Project Euclid
Random partitions can be thought of as a consistent family of exchangeable random partitions of the sets {1,2,...,n} for n≥1. Historically, random partitions were constructed by sampling an infinite population of types and partitioning individuals of the same type into a single class. A particularly tractable way to construct random partitions is via random sequences of 0s and 1s. The only random partition derived from an independent 0-1 sequence is Ewens' one-parameter family of partitions which plays a predominant role in population genetics. A two-parameter generalization of Ewens' partition is obtained by considering random partitions constructed from discrete renewal processes and introducing a convolution-type product on 0-1 sequences.
Publié le : 2005-10-14
Classification:  combinatorial probability,  combinatorial stochastic process,  exchangeable,  random partition,  sequential construction
@article{1130077597,
     author = {Young, James E.},
     title = {Binary sequential representations of random partitions},
     journal = {Bernoulli},
     volume = {11},
     number = {1},
     year = {2005},
     pages = { 847-861},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1130077597}
}
Young, James E. Binary sequential representations of random partitions. Bernoulli, Tome 11 (2005) no. 1, pp.  847-861. http://gdmltest.u-ga.fr/item/1130077597/