Convergence to stationary state for a Markov move-to-front scheme
Keyword(s):
This work considers items (e.g. books, files) arranged in an array (e.g. shelf, tape) with N positions and assumes that items are requested according to a Markov chain (possibly, of higher order). After use, the requested item is returned to the leftmost position of the array. Successive applications of the procedure above give rise to a Markov chain on permutations. For equally likely items, the number of requests that makes this Markov chain close to its stationary state is estimated. To achieve that, a coupling argument and the total variation distance are used. Finally, for non-equally likely items and so-called p-correlated requests, the coupling time is presented as a function of the coupling time when requests are independent.
1995 ◽
Vol 32
(03)
◽
pp. 768-776
◽
Keyword(s):
2015 ◽
Vol 47
(1)
◽
pp. 83-105
◽
2015 ◽
Vol 47
(01)
◽
pp. 83-105
◽
2001 ◽
Vol 10
(4)
◽
pp. 293-308
◽
2017 ◽
Vol 2017
◽
pp. 1-11
◽
2002 ◽
Vol 34
(03)
◽
pp. 609-625
◽
2016 ◽
Vol 52
(4)
◽
pp. 1614-1640
◽
2018 ◽
Vol 52
(4)
◽
pp. 662-679
◽
2014 ◽
Vol 59
(9)
◽
pp. 2353-2368
◽