Limiting search cost distribution for the move-to-front rule with random request probabilities

Simple item page
dc.creatorBarrera, Javiera
dc.creatorHuillet, Thierry
dc.creatorParoissin, Christian
dc.date2005-06-17
dc.date.accessioned2026-07-07T05:20:48Z
dc.date.available2026-07-07T05:20:48Z
dc.descriptionConsider a list of $n$ 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 $n$ tends to infinity. Some examples are supplied.
dc.descriptionmove-to-front, search cost, random discrete distribution, limiting distribution, size biased permutation
dc.identifierhttps://arxiv.org/abs/math/0506343
dc.identifierhttp://arxiv.org/abs/math/0506343
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75515
dc.subjectProbability
dc.subjectAMS 2000 Classification: 68W40, 68P10
dc.titleLimiting search cost distribution for the move-to-front rule with random request probabilities
dc.typetext

Files

Collections

arXiv