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

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

2005-06-17

arxiv.org/abs/math/0506343v1

Mathematics

Probability

move-to-front, search cost, random discrete distribution, limiting distribution, size biased permutation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Limiting search cost distribution for the move-to-front rule with random request probabilities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limiting search cost distribution for the move-to-front rule with random request probabilities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limiting search cost distribution for the move-to-front rule with random request probabilities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448208