Article contents
Single-shelf library-type Markov chains with infinitely many books
Published online by Cambridge University Press: 14 July 2016
Abstract
In a single-shelf library having infinitely many books B1, B2, …, the probability of selecting each book is assumed known. Books are removed one at a time and replaced in position k prior to the next removal. Books are moved either to the right or the left as is necessary to vacate position k. Those arrangements of books where after some finite position all the books are in natural order (book i occupies position i) are considered as states in an infinite Markov chain. When k > 1, we show that the chain can never be positive recurrent. When k = 1, we find the limits of ratios of one-step transition probabilities; and when k = 1 and the chain is transient, we find the Martin exit boundary.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1977
References
- 6
- Cited by