Limiting search cost distribution for the move-to-front rule with random request probabilities
Probability
2007-05-23 v1
Abstract
Consider a list of files whose popularities are random. These files are updated according to the move-to-front rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as tends to infinity. Some examples are supplied.
Keywords
Cite
@article{arxiv.math/0506343,
title = {Limiting search cost distribution for the move-to-front rule with random request probabilities},
author = {Javiera Barrera and Thierry Huillet and Christian Paroissin},
journal= {arXiv preprint arXiv:math/0506343},
year = {2007}
}
Comments
move-to-front, search cost, random discrete distribution, limiting distribution, size biased permutation