English

Exchangeable Gibbs partitions and Stirling triangles

Probability 2007-05-23 v1 Combinatorics

Abstract

For two collections of nonnegative and suitably normalised weights \W=(\Wj)\W=(\W_j) and \V=(\Vn,k)\V=(\V_{n,k}), a probability distribution on the set of partitions of the set {1,...,n}\{1,...,n\} is defined by assigning to a generic partition {Aj,jk}\{A_j, j\leq k\} the probability \Vn,k\WA1...\WAk\V_{n,k} \W_{|A_1|}... \W_{|A_k|}, where Aj|A_j| is the number of elements of AjA_j. We impose constraints on the weights by assuming that the resulting random partitions Πn\Pi_n of [n][n] are consistent as nn varies, meaning that they define an exchangeable partition of the set of all natural numbers. This implies that the weights \W\W must be of a very special form depending on a single parameter α[,1]\alpha\in [-\infty,1]. The case α=1\alpha=1 is trivial, and for each value of α1\alpha\neq 1 the set of possible \V\V-weights is an infinite-dimensional simplex. We identify the extreme points of the simplex by solving the boundary problem for a generalised Stirling triangle. In particular, we show that the boundary is discrete for α<0-\infty\leq\alpha<0 and continuous for 0α<10\leq\alpha<1. For α0\alpha\leq 0 the extremes correspond to the members of the Ewens-Pitman family of random partitions indexed by (α,θ)(\alpha,\theta), while for 0<α<10<\alpha<1 the extremes are obtained by conditioning an (α,θ)(\alpha,\theta)-partition on the asymptotics of the number of blocks of Πn\Pi_n as nn tends to infinity.

Keywords

Cite

@article{arxiv.math/0412494,
  title  = {Exchangeable Gibbs partitions and Stirling triangles},
  author = {Alexander Gnedin and Jim Pitman},
  journal= {arXiv preprint arXiv:math/0412494},
  year   = {2007}
}

Comments

13 pages