Skip to main content

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

Leisen, Fabrizio, Lijoi, Antonio, Paroissin, Christian (2011) Limiting behavior of the search cost distribution for the move-to-front rule in the stable case. Statistics & Probability Letters, 81 (12). pp. 1827-1832. ISSN 0167-7152. (doi:10.1016/j.spl.2011.07.016) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/j.spl.2011.07.016

Abstract

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. A main problem is the study of the distribution of the search cost defined as the position of the required item. Here we first establish the link between two recent papers of Barrera and Paroissin and Lijoi and Pruenster that both extend the results proved by Kingman on the expected stationary search cost. By combining the results contained in these papers, we obtain the limiting behavior for any moments of the stationary search cost as n tends to infinity.

Item Type: Article
DOI/Identification number: 10.1016/j.spl.2011.07.016
Subjects: Q Science > QA Mathematics (inc Computing science) > QA273 Probabilities
Divisions: Faculties > Sciences > School of Mathematics Statistics and Actuarial Science
Faculties > Sciences > School of Mathematics Statistics and Actuarial Science > Statistics
Depositing User: Fabrizio Leisen
Date Deposited: 07 Jun 2014 09:35 UTC
Last Modified: 01 Aug 2019 10:36 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/36525 (The current URI for this page, for reference purposes)
Leisen, Fabrizio: https://orcid.org/0000-0002-2460-6176
  • Depositors only (login required):