The number of small blocks in exchangeable random partitions

preprint2010arXivOpen access

Abstract

Suppose ΠΠ is an exchangeable random partition of the positive integers and ΠnΠ_n is its restriction to {1,...,n}\{1, ..., n\}. Let KnK_n denote the number of blocks of ΠnΠ_n, and let Kn,rK_{n,r} denote the number of blocks of ΠnΠ_n containing rr integers. We show that if 0<α<10 < α< 1 and Kn/(nαℓ(n))K_n/(n^α \ell(n)) converges in probability to Γ(1−α)Γ(1-α), where ℓ\ell is a slowly varying function, then Kn,r/(nαℓ(n))K_{n,r}/(n^α \ell(n)) converges in probability to αΓ(r−α)/r!αΓ(r - α)/r!. This result was previously known when the convergence of Kn/(nαℓ(n))K_n/(n^α \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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.