Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-20T00:47:30.594Z Has data issue: false hasContentIssue false
  • English
  • Français

On convergence and extensions of size-biased permutations

Part of: Stochastic processes Distribution theory

Published online by Cambridge University Press:  14 July 2016

Alexander V. Gnedin
Alexander V. Gnedin*
Affiliation:
University of Göttingen
*
∗Postal address: Institute of Mathematical Stochastics, University of Göttingen, Lotzestrasse 13, 37083 Göttingen, Germany. Email address: gnedin@math.uni-goettingen.de.
Get access Rights & Permissions [Opens in a new window]

Abstract

Size-biased permutation (SBP) is a random arrangement of frequencies of distinct categories in the order in which the categories appear for the first time in the sampling process. We study the conditions under which the SBPs converge in distribution and discuss extended versions of SBP for the case when the sum of positive frequencies is less than 1.

Keywords

Samplingsize-biased permutationpaintbox process

MSC classification

Primary: 62E10: Characterization and structure theory
Secondary: 60G09: Exchangeability
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 3 , September 1998 , pp. 642 - 650
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aldous, D. J. (1985). Exchangeability and related topics. In: École d'Été de Probabilités de Saint-Flour XII, ed. Hennequin, P.L., Lecture Notes in Mathematics 1117, Springer, Berlin.Google Scholar
Donnelly, P. (1986). Partition structures, Polya urns, the Ewens sampling formula and the ages of alleles. Theoret. Popn Biol. 30, 271–288.Google Scholar
Donnelly, P. (1991). The heaps process, libraries and size-biased permutations. J. Appl. Prob. 28, 322–335.Google Scholar
Donnelly, P., and Joyce, P. (1989). Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex. Stoch. Proc. Appl. 31, 89–103.Google Scholar
Donnelly, P., and Joyce, P. (1991). Consistent ordered sampling distributions: characterization and convergence. Adv. Appl. Prob. 23, 229–258.Google Scholar
Gnedin, A. V. (1997). The representation of composition structures. Ann. Prob. 25, 1437–1450.Google Scholar
Gnedin, A. V. (1998). On the Poisson–Dirichlet limit. To appear in J. Multivariate Anal. 66.Google Scholar
Hoppe, F. M. (1986). Size biased filtering of Poisson–Dirichlet samples with an application to partition structures in genetics. J. Appl. Prob. 23, 1008–1012.Google Scholar
Kerov, S. V. (1995). Subordinators and permutation actions with invariant measure. Zapiski Nauchnych Seminarov POMI 223, 181–218 (in Russian).Google Scholar
Kingman, J. F. C. (1978). The representation of partition structures. J. London Math. Soc. (2) 18, 374–380.Google Scholar
Patil, G.P., and Taillie, C. (1977). Diversity as a concept and its implications for random communities. Bull. Int. Stat. Inst. XLVII, 495–515.Google Scholar
Pitman, J. (1995). Exchangeable and partially exchangeable random partitions. Prob. Theory Rel. Fields 102, 145–158.Google Scholar
Pitman, J. (1996). Random discrete distributions invariant under size-biased permutation, Adv. Appl. Prob. 28, 525–539.Google Scholar
Pitman, J., and Yor, M. (1995). Random discrete distribution derived from self-similar random sets. Electr. J. Prob. 1, 1–28.Google Scholar
Sibuya, M., and Yamato, H. (1995). Ordered and unordered random partitions of an integer and the GEM distribution. Stat. Prob. Lett. 25, 177–183.Google Scholar
Vershik, A. M., and Shmidt, A. A. (1977). Limit measures arising in the asymptotic theory of symmetric groups, I. Theory Prob. Appl. 22, 79–85.Google Scholar