Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-08T08:25:54.663Z Has data issue: false hasContentIssue false

Increments of Random Partitions

Published online by Cambridge University Press:  07 June 2006

ŞERBAN NACU
Affiliation:
Department of Statistics, University of California, Berkeley, CA 94720, USA (e-mail: serban@stat.berkeley.eduhttp://stat-www.berkeley.edu/~serban)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For any partition of $\{1, 2, \ldots{,}\, n\}$ we define its increments$X_i, 1 \leq i \leq n$ by $X_i = 1$ if $i$ is the smallest element in the partition block that contains it, $X_i = 0$ otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partition. One consequence is that the Chinese Restaurant Process CRP($\theta$) (the partition with distribution given by the Ewens sampling formula with parameter $\theta$) is the only exchangeable random partition with independent increments.

Information

Type
Paper
Copyright
2006 Cambridge University Press