Abstract
In a single-shelf library of N books we suppose that books are returned by placing them at one end of the shelf. The probability of selecting each book is assumed to be known, and only one book is removed at a time. The N! arrangements of the books are considered as states of an ergodic Markov chain for which we find the stationary distribution.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mathematical Modelling of Distributed Memory System;Recent Developments and the New Directions of Research, Foundations, and Applications;2023
2. Practical Bounds on Optimal Caching with Variable Object Sizes;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2018-06-13
3. Generalizations of an Expansion Formula for Top to Random Shuffles;Annals of Combinatorics;2016-10-12
4. 14 Markov Chains;Representation Theory of Finite Monoids;2016
5. On the distribution of the search cost for the move-to-front rule with random weights;Journal of Applied Probability;2004-03