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

DOI10.1016/j.spl.2011.07.016zbMath1230.68065arXiv1006.5835OpenAlexW2949064095MaRDI QIDQ645427

Fabrizio Leisen, Antonio Lijoi, Christian Paroissin

Publication date: 15 November 2011

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.5835

zbMATH Keywords

normalized random measurestable subordinatorproblem of heapsrandom discrete distribution

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial probability (60C05)

Related Items (1)

Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process

Cites Work

• Distributional results for means of normalized random measures with independent increments
• Limiting search cost distribution for the move-to-front rule with random request probabilities
• SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION
• On the distribution of the search cost for the move-to-front rule with random weights
• On Serial Files with Relocatable Records
• FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Limiting behavior of the search cost distribution for the move-to-front rule in the stable case