Abstract
This chapter introduces a basic sequential construction of random partitions, motivated at first by consideration of uniform random permutations of [n] which are consistent in a certain sense as n varies. This leads to consideration of a particular two-parameter family of exchangeable random partition structures, which can be characterized in various ways, and which is closely related to gamma and stable subordinators.
Keywords
- Random Permutation
- Prediction Rule
- Dirichlet Process
- Random Partition
- Sequential Construction
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin/Heidelberg
About this chapter
Cite this chapter
Pitman, J. (2006). Sequential constructions of random partitions. In: Picard, J. (eds) Combinatorial Stochastic Processes. Lecture Notes in Mathematics, vol 1875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-34266-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-34266-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30990-1
Online ISBN: 978-3-540-34266-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
