Consider 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.Comment: move-to-front, search cost, random discrete distribution, limiting
distribution, size biased permutatio