Limiting search cost distribution for the move-to-front rule with random   request probabilities
  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. 
Javiera Barrera (MAP5), Thierry Huillet (LPTM), Christian Paroissin   (LMA - PAU)