Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex

31Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Ranked and size-biased permutations are particular functions on the set of probability measures on the simplex. They represent two recently studied schemes for relabelling groups in certain stochastic models, and are of particular interest in describing the limiting behaviour of such models. We prove that the ranked permutations of a sequence of measures converge if and only if the size-biased permutations converge, and give conditions under which weak convergence of measures guarantees weak convergence of both permutations. Applications include a proof of the fact that the GEM distribution is the size biased permutation of the Poisson-Dirichlet and a new proof of the fact that when labelled in a particular way, normalized cycle lengths in a random permutation converge to the GEM distribution. These techniques also allow some problems concerned with the random splitting of an interval to be related to known results in other fields. © 1989.

Cite

CITATION STYLE

APA

Donnelly, P., & Joyce, P. (1989). Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex. Stochastic Processes and Their Applications, 31(1), 89–103. https://doi.org/10.1016/0304-4149(89)90104-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free