Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-15T00:21:07.204Z Has data issue: false hasContentIssue false
  • English
  • Français

On the transition probabilities of the move-to-front scheme

Part of: Theory of computing Markov processes

Published online by Cambridge University Press:  14 July 2016

R. M. Phatarfod
R. M. Phatarfod*
Affiliation:
Monash University
*
∗ Postal address: Department of Mathematics, Monash University, Clayton, VIC 3168, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

The transition probabilities of the move-to-front scheme are obtained by exploiting the connection between it and the coupon-collector's problem.

Keywords

COUPON-COLLECTOR'S PROBLEMLINEAR SEARCH

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 68Q25: Analysis of algorithms and problem complexity
Type
Short Communications
Information
Journal of Applied Probability , Volume 31 , Issue 2 , June 1994 , pp. 570 - 574
Copyright
Copyright © Applied Probability Trust 1994 

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

References

Bitner, J. R. (1979) Heuristics that dynamically organize data structures. SIAM J. Computing 8, 82–110.CrossRefGoogle Scholar
Burville, P. J. and Kingman, J. F. C. (1973) On a model for storage and search. J. Appl. Prob. 10, 697–701.CrossRefGoogle Scholar
Hendricks, W. J. (1972) The stationary distribution of an interesting Markov chain. J. Appl. Prob. 9, 231–233.Google Scholar
Hendricks, W. J. (1976) An account of self organizing systems, SIAM J. Computing 5, 715–723.Google Scholar
Nelson, P. J. (1977) Single shelf library type Markov chains with infinitely many books. J. Appl. Prob. 14, 298–308.CrossRefGoogle Scholar
Phatarfod, R. M. (1991) On the matrix occurring in a linear search problem. J. Appl. Prob. 28, 336–346.Google Scholar