The heaps process, libraries, and size-biased permutations

DOI10.2307/3214869zbMath0727.60078OpenAlexW2335572405MaRDI QIDQ3349714

Peter Donnelly

Publication date: 1991

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214869

zbMATH Keywords

random permutationcoupling techniquesPoisson-Dirichlet distributionDirichlet initial distributionpartial size-biased permutationTsetlin libraries

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (max. 100)

Ewens sampling formulae with and without selection ⋮ Exchangeable and partially exchangeable random partitions ⋮ On the distribution of the search cost for the move-to-front rule with random weights ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Ordered and size-biased frequencies in GEM and Gibbs' models for species sampling ⋮ Eigenvalues of LRU via a linear algebraic approach ⋮ Regenerative random permutations of integers ⋮ Markov Chains for Promotion Operators ⋮ Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex ⋮ Random shuffles on trees using extended promotion ⋮ A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements ⋮ Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process ⋮ Combinatorial Markov chains on linear extensions ⋮ Limiting search cost distribution for the move-to-front rule with random request probabilities ⋮ Size-biased sampling and discrete nonparametric Bayesian inference ⋮ SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION ⋮ Sampling Formulae Arising from Random Dirichlet Populations ⋮ Unordered and ordered sample from Dirichlet distribution ⋮ Properties of the promotion Markov chain on linear extensions ⋮ Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement ⋮ EXPLOITING THE WAITING TIME PARADOX: APPLICATIONS OF THE SIZE-BIASING TRANSFORMATION

This page was built for publication: The heaps process, libraries, and size-biased permutations