arXiv Analytics

Sign in

arXiv:math/0512378 [math.PR]AbstractReferencesReviewsResources

Gibbs distributions for random partitions generated by a fragmentation process

Nathanael Berestycki, Jim Pitman

Published 2005-12-15, updated 2006-11-14Version 2

In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We provide conditions on the weight sequence w allowing construction of a partition valued random process where at step k the state has the Gibbs (n,k,w) distribution, so the partition is subject to irreversible fragmentation as time evolves. For a particular one-parameter family of weight sequences w\_j, the time-reversed process is the discrete Marcus-Lushnikov coalescent process with affine collision rate K\_{i,j}=a+b(i+j) for some real numbers a and b. Under further restrictions on a and b, the fragmentation process can be realized by conditioning a Galton-Watson tree with suitable offspring distribution to have n nodes, and cutting the edges of this tree by random sampling of edges without replacement, to partition the tree into a collection of subtrees. Suitable offspring distributions include the binomial, negative binomial and Poisson distributions.

Comments: 38 pages, 2 figures, version considerably modified. To appear in the Journal of Statistical Physics
Subjects: 60J10, 60K35, 05A15, 05A19
Related articles: Most relevant | Search more
arXiv:2108.06303 [math.PR] (Published 2021-08-13)
On the uniqueness of Gibbs distributions with a non-negative and subcritical pair potential
arXiv:math/0609806 [math.PR] (Published 2006-09-28)
Meixner polynomials and random partitions
arXiv:math/0607635 [math.PR] (Published 2006-07-25)
Central limit theorem for random partitions under the Plancherel measure