Consider a list of labeled objects that are organized in a heap. At each time, object $j$ is selected with probability $p_j$ and moved to the top of the heap. This procedure defines a Markov chain on the set of permutations which is referred to in the literature as Move-to-Front rule. The present contribution focuses on the stationary search cost, namely the position of the requested item in the heap when the Markov chain is in equilibrium. We consider the scenario where the number of objects is infinite and the probabilities $p_j$’s are defined as the normalization of the increments of a subordinator. In this setting, we provide an exact formula for the moments of any order of the stationary search cost distribution. We illustrate the new findings in the case of a generalized gamma subordinator and deal with an extension to the two–parameter Poisson–Dirichlet process, also known as Pitman–Yor process.
"Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process." Electron. Commun. Probab. 23 1 - 10, 2018. https://doi.org/10.1214/18-ECP111