The heaps process, libraries, and size-biased permutations
From MaRDI portal
Publication:3349714
DOI10.2307/3214869zbMath0727.60078MaRDI QIDQ3349714
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
random permutation; coupling techniques; Poisson-Dirichlet distribution; Dirichlet initial distribution; partial size-biased permutation; Tsetlin libraries
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
Related Items
SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION, Sampling Formulae Arising from Random Dirichlet Populations, On the distribution of the search cost for the move-to-front rule with random weights, Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex, Size-biased sampling and discrete nonparametric Bayesian inference, Exchangeable and partially exchangeable random partitions, An exact formula for the move-to-front rule for self-organizing lists, A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements, Ewens sampling formulae with and without selection, Limiting search cost distribution for the move-to-front rule with random request probabilities, Unordered and ordered sample from Dirichlet distribution, EXPLOITING THE WAITING TIME PARADOX: APPLICATIONS OF THE SIZE-BIASING TRANSFORMATION
