Open Access
October 2005 Binary sequential representations of random partitions
James E. Young
Author Affiliations +
Bernoulli 11(5): 847-861 (October 2005). DOI: 10.3150/bj/1130077597


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.


Download Citation

James E. Young. "Binary sequential representations of random partitions." Bernoulli 11 (5) 847 - 861, October 2005.


Published: October 2005
First available in Project Euclid: 23 October 2005

zbMATH: 1093.60008
MathSciNet: MR2172844
Digital Object Identifier: 10.3150/bj/1130077597

Keywords: combinatorial probability , combinatorial stochastic process , Exchangeable , random partition , sequential construction

Rights: Copyright © 2005 Bernoulli Society for Mathematical Statistics and Probability

Vol.11 • No. 5 • October 2005
Back to Top