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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Probability, AMS 2000 Classification: 68W40, 68P10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/75515

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0506343
 http://arxiv.org/abs/math/0506343

Collections

arXiv