@article{1e395c17139a4ddfbbd0483a7ed25c9c,
title = "Limiting search cost distribution for the move-to-front rule with random request probabilities",
abstract = "Consider a list of n files whose popularities are random. The list is updated according to the move-to-front rule. When the induced Markov chain is at equilibrium, we explicitly compute the limiting distribution of the search-cost per item as n tends to infinity. The uniform distribution results in the largest search cost.",
keywords = "Limiting distribution, Move-to-front, Random discrete distribution, Search cost, Size-biased permutation",
author = "Javiera Barrera and Thierry Huillet and Christian Paroissin",
note = "Funding Information: The authors thank support from FONDAP-CONICYT in Applied Mathematics and Millenium Nucleus in Information and Randomness ICM P01-005. J. B. wishes to thank CONICYT National Postgraduate Fellowship Program supporting her Ph.D. The authors also thank their referees for suggested improvements of the original draft.",
year = "2006",
month = sep,
doi = "10.1016/j.orl.2005.09.007",
language = "English",
volume = "34",
pages = "557--563",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier B.V.",
number = "5",
}