Limiting behavior of the search cost distribution for the move-to-front rule in the stable case

Details Limiting behavior of the search cost distribution for the move-to-front rule in the stable case Limiting behavior of the search cost distribution for the move-to-front rule in the stable case

2010-06-30

arxiv.org/abs/1006.5835v1

Mathematics

Probability

Scientific paper

Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. One main problem is the study of the distribution of the search cost dened as the position of the required item. Here we first establish the link between two recent papers that both extend results proved by Kingman on the expected stationary search cost. Combining results contained in these papers, we obtain the limiting behavior for any moments of the stationary seach cost as n tends to innity.

Affiliated with

Also associated with

No associations

Rating

Limiting behavior of the search cost distribution for the move-to-front rule in the stable case 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 behavior of the search cost distribution for the move-to-front rule in the stable case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limiting behavior of the search cost distribution for the move-to-front rule in the stable case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153872