Limits and rates of convergence for the distribution of search cost under the move-to-front rule
We derive upper and lower bounds on total variation distance to stationarity for the distribution of search cost under the move-to-front (MTF) rule for self-organizing lists with i.i.d. record requests. These enable us to obtain sharp rates of convergence for several standard examples of weights, in...
Saved in:
| Published in: | Theoretical computer science Vol. 164; no. 1; pp. 185 - 206 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
10-09-1996
|
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We derive upper and lower bounds on total variation distance to stationarity for the distribution of search cost under the move-to-front (MTF) rule for self-organizing lists with i.i.d. record requests. These enable us to obtain sharp rates of convergence for several standard examples of weights, including Zipf's law and geometric weights, as the length of the list becomes large. The upper bound also shows that a number of moves of the order of the length of the list is uniformly sufficient for near-stationarity over all choices of weights. Concerning the stationary search cost distribution itself, we use a representation obtained by considering the continuized MTF Markov chain to derive, for each of the standard examples, the asymptotic distribution for long lists. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/0304-3975(95)00210-3 |