Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T21:56:27.872Z Has data issue: false hasContentIssue false
  • English
  • Français

The heaps process, libraries, and size-biased permutations

Published online by Cambridge University Press:  14 July 2016

Peter Donnelly
Peter Donnelly*
Affiliation:
Queen Mary and Westfield College, London
*
∗Postal address: School of Mathematical Sciences, Queen Mary and Westfield College, University of London, Mile End Road, London El 4NS, UK.
Get access Rights & Permissions [Opens in a new window]

Abstract

The heaps process (also known as a Tsetlin library) provides a model for a self-regulating filing system. Items are requested from time to time according to their popularity and returned to the top of the heap after use. The size-biased permutation of a collection of popularities is a particular random permutation of those popularities, which arises naturally in a number of applications and is of independent interest. For a slightly non-standard formulation of the heaps process we prove that it converges to the size-biased permutation of its initial distribution. This leads to a number of new characterizations of the property of invariance under size-biased permutation, notably what might be described as invariance under ‘partial size-biasing' of any order. Finally we consider in detail the heaps process with Poisson–Dirichlet initial distribution, exhibiting the tractable nature of its equilibrium distribution and explicitly calculating a number of quantities of interest.

Keywords

TSETLIN LIBRARIESMARKOV CHAINS ON PERMUTATIONSCOUPLING TECHNIQUESPOISSON–DIRICHLET DISTRIBUTIONGEM DISTRIBUTIONPARTIAL SIZE-BIASED PERMUTATION

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 2 , June 1991 , pp. 321 - 335
Copyright
Copyright © Applied Probability Trust 1991 

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.)

Article purchase

Temporarily unavailable

References

Burville, P. J. (1974) Heaps: a concept in optimization. J. Inst. Math. Appl. 13, 263–278.Google Scholar
Burville, P. J. and Kingman, J. F. C. (1973) On a model for storage and search. J. Appl. Prob. 10, 697–701.10.2307/3212792Google Scholar
Dies, J. E. (1983) Chaînes de Markov sur les permutations. Lecture Notes in Mathematics 1010, Springer-Verlag, Berlin.Google Scholar
Dies, J. E. (1987) Transcience des chaînes de Markov linéaires sur les permutations. J. Appl. Prob 24, 899–907.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. 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
Ewens, W. J. (1990) Population genetics theory — the past and the future. In Mathematical and Statistical Developments of Evolutionary Theory, ed. Lessard, S. Kluwer, Dordrecht.Google Scholar
Hendricks, W. J. (1972) The stationary distribution of an interesting Markov chain. J. Appl. Prob. 9, 231–233.Google Scholar
Hoppe, F. M. (1987) The sampling theory of neutral alleles and an urn model in population genetics. J. Math. Biol. 25, 123–159.Google Scholar
Kingman, J. F. C. (1975) Random discrete distributions. J. R. Statist. Soc. B37, 1–22.Google Scholar
Kingman, J. F. C. (1977) The population structure associated with the Ewens sampling formula. Theoret. Popn. Biol. 11, 274–284.Google Scholar
Letac, G. (1974) Transience and recurrence of an interesting Markov chain. J. Appl. Prob. 11, 818–824.Google Scholar
Mccabe, J. (1965) On serial files with relocatable records. Operat. Res. 13, 607–618.Google Scholar
Patil, G. P. and Taillie, C. (1977) Diversity as a concept and its implications for random communities. Bull. Internat. Statist. Inst. 47, 497–515.Google Scholar
Tsetlin, M. L. (1963) Finite automata and models of simple form of behaviour. Russian Math. Surveys 18, 1–28.Google Scholar