The Poisson-Dirichlet family consists of laws of decreasing random mass partitions with . Its two-parameter notation is , with and . The conventional one-parameter probability distribution means , for , and can be constructed from normalized gamma jumps.
Take a Poisson random measure on with intensity and arrange its atoms as . The sum is finite and positive almost surely, has Gamma distribution with shape and rate one, and the law of is . The order is decreasing, so the first component is the largest; a size-biased selection of a component has a different law.
For , at most one component exceeds , so . Below one half several components can exceed the threshold. Put and use the finite identity , with the factorial moment densities of Poisson-Dirichlet components. It gives the full probability distribution as finite inclusion-exclusion over , . In contrast, a size-biased component is beta-distributed.
This density is supported where all and , and gives the expected sum over ordered distinct components of . Apply the iterated Mecke formula for a Poisson random measure to selected jumps and the remaining gamma total . With and , the Jacobian is and the integral in is , giving the density. It describes joint counts of large components, beyond the first-moment measure.
For , whenever the absolute integral is finite. Apply the Mecke formula for a Poisson random measure to a selected jump and the remaining total , whose density is . Changing variables to and factors out a Gamma function and gives the displayed measure. Weighting it by gives a probability density , the Beta distribution of a size-biased component.
A restricted-growth string encodes a partition of the ordered label set by numbering blocks in the order in which they first appear. For a nonempty string , the rule isEqual entries identify elements in the same block. For example, encodes . At the next position one may reuse an existing block number or introduce exactly the next unused number; skipping a new number would break the convention.
Every set partition has one such canonical encoding, so these strings enumerate set partitions without repeatedly counting permutations of the block names. Their number is the Bell number , and the number with exactly distinct labels is the Stirling number of the second kind .
An Exchangeable random partition has a law invariant under finite permutations of the underlying labels.
Articles by others on the same topic
There are currently no matching articles.