Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T01:52:40.197Z Has data issue: false hasContentIssue false

Convergence to stationary state for a Markov move-to-front scheme

Published online by Cambridge University Press:  14 July 2016

Eliane R. Rodrigues*
Affiliation:
Universidade de Brasilia
*
∗ Postal address: Universidade de Brasília, Departamento de Matemática, Campus Universitário, Asa Norte, 70.919–900, Brasilia DF, Brazil.

Abstract

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.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1995 

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

Article purchase

Temporarily unavailable