English

The number of small blocks in exchangeable random partitions

Probability 2010-07-14 v2

Abstract

Suppose Π\Pi is an exchangeable random partition of the positive integers and Πn\Pi_n is its restriction to {1,...,n}\{1, ..., n\}. Let KnK_n denote the number of blocks of Πn\Pi_n, and let Kn,rK_{n,r} denote the number of blocks of Πn\Pi_n containing rr integers. We show that if 0<α<10 < \alpha < 1 and Kn/(nα(n))K_n/(n^{\alpha} \ell(n)) converges in probability to Γ(1α)\Gamma(1-\alpha), where \ell is a slowly varying function, then Kn,r/(nα(n))K_{n,r}/(n^{\alpha} \ell(n)) converges in probability to αΓ(rα)/r!\alpha \Gamma(r - \alpha)/r!. This result was previously known when the convergence of Kn/(nα(n))K_n/(n^{\alpha} \ell(n)) holds almost surely, but the result under the hypothesis of convergence in probability has significant implications for coalescent theory. We also show that a related conjecture for the case when KnK_n grows only slightly slower than nn fails to be true.

Keywords

Cite

@article{arxiv.0911.1793,
  title  = {The number of small blocks in exchangeable random partitions},
  author = {Jason Schweinsberg},
  journal= {arXiv preprint arXiv:0911.1793},
  year   = {2010}
}