An exact formula for the move-to-front rule for self-organizing lists

Journal of Theoretical Probability

Volumn 9, Issue 1, 1996, Pages 113-160

  Fill, James Allen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Convergence to stationarity; Eigenvalues; Markov chains; Move to front rule; Permutations; Self organizing search; Separation; Tsetlin library

Indexed keywords

EID: 6344286246     PISSN: 08949840     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02213737     Document Type: Article

References (32)

1. Aldous, D., and Diaconis, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93, 333-348.
2. Aldous, D., and Diaconis, P. (1987). Strong uniform times and finite random walks. Advances in Appl. Math. 8, 69-97.
3. Bentley, J. L., and McGeoch, C. C. (1985). Amortized analyses of self-organizing sequential search heuristics. Comm. ACM 28, 404-411.
4. Bentley, J. L., Sleator, D. D., Tarjan, R. E., and Wei, V. K. (1986). A locally adaptive data compression scheme. Comm. ACM 29, 320-330.
5. Bitner, J. R. (1979). Heuristics that dynamically organize data structures. SIAM J. Comput. 8, 82-110.
6. Björner, A. (1984). Orderings of Coxeter groups, in Combinatorics and Algebra, Amer. Math. Soc., Providence, Rhode Island, Contemporary Math. 34, 175-195.
7. Burville, P. J. (1974). Heaps: a concept in optimization. J. Inst. Math. Applic. 13, 263-278.
8. Burville, P. J., and Kingman, J. F. C. (1973). On a model for storage and search. J. Appl. Prob. 10, 697-701.
9. Diaconis, P. (1993). Analysis of some weighted mixing schemes (unpublished manuscript).
10. Diaconis, P., and Fill, J. A. (1990). Strong stationary times via a new form of duality. Ann. Prob. 18, 1483-1522.
11. Diaconis, P., Fill, J. A., and Pitman, J. (1992). Analysis of top to random shuffles. Comb. Prob. and Comp. 1, 135-155.
12. Donnelly, P. (1991). The heaps process, libraries and size-biased permutations. J. Appl. Prob. 28, 321-335.
13. Feller, W. (1968). An Introduction to Probability Theory and its Applications. Vol. 1, 3rd ed., Wiley, New York.
14. Gonnet, G. H., Munro, J. I., and Suwanda, H. (1981). Exegesis of self-organizing linear search. SIAM J. Comput. 3, 613-637.
15. Hendricks, W. J. (1972). The stationary distribution of an interesting Markov chain. J. Appl. Prob. 9, 231-233.
16. Hendricks, W. J. (1976). An account of self-organizing systems. SIAM J. Comput. 5, 715-723.
17. Hendricks, W. J. (1989). Self-organizing Markov chains. MITRE Corporation, McLean, Virginia.
18. Hester, J. H., and Hirschberg, D. S. (1985). Self-organizing linear search. ACM Comp. Surveys 19, 295-311.
19. Kan, Y. C., and Ross, S. M. (1980). Optimal list order under partial memory constraints. J. Appl. Prob. 17, 1004-1015.
20. Kapoor, S., and Reingold, E. (1991). Stochastic rearrangement rules for self-organizing data structures. Algorithmica 6, 278-291.
21. Kingman, J. F. C. (1975). Random discrete distributions. J. R. Statist. Soc. B 37, 1-22.
22. Lam, K., Leung, M. Y., and Siu, M. K. (1984). Self-organizing files with dependent accesses. J. Appl. Prob. 21, 343-359.
23. Lelewer, D. A., and Hirschberg, D. S. (1987). Self-organizing linear search. ACM Computing Surveys 19, 261-296.
24. Letac, G. (1974). Transience and recurrence of an interesting Markov chain. J. Appl. Prob. 11, 818-824.
25. McCabe, J. (1965). On serial files with relocatable records. Oper. Res. 13, 609-618.
26. Phatarfod, R. M. (1991). On the matrix occurring in a linear search problem. J. Appl. Prob. 28, 336-346.
27. Phatarfod, R. M. (1994). On the transition probabilities of move to the front scheme. J. Appl. Prob. 31, 570-574.
28. Rivest, R. (1976). On self-organizing sequential search heuristics. Comm. ACM 19, 63-66.
29. Sleator, D. D., and Tarjan, R. E. (1985a). Amortized efficiency of list update and paging rules. Comm. ACM 28, 202-208.
30. Sleator, D. D., and Tarjan, R. E. (1985b). Self-adjusting binary search trees. J. ACM 32, 652-686.
31. Topkis, D. M. (1986). Reordering heuristics for routing in communications networks. J. Appl. Prob. 23, 130-143.
32. Tsetlin, M. L. (1963). Finite automata and models of simple forms of behavior. Russian Math. Surv. 18(4), 1-27.