The number of small blocks in exchangeable random partitions
Abstract
Suppose is an exchangeable random partition of the positive integers and n is its restriction to \1, ..., n\. Let Kn denote the number of blocks of n, and let Kn,r denote the number of blocks of n containing r integers. We show that if 0 < α < 1 and Kn/(nα (n)) converges in probability to (1-α), where is a slowly varying function, then Kn,r/(nα (n)) converges in probability to α (r - α)/r!. This result was previously known when the convergence of Kn/(nα (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 Kn grows only slightly slower than n fails to be true.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.