Size-Biased Permutation of Dirichlet Partitions and Search-Cost Distribution

Authors:
Javiera Barrera;Thierry Huillet;Christian Paroissin
Affiliations:
Departmento Ingeniería Matemática and Centro Modelamiento Matemático, UMR 2071 UCHILE-CNRS, Santiago, Chile, E-mail: barrera@dim.uchile.cl;Laboratoire de Physique Théorique et Modélisation, CNRS-UMR 8089 et Université de Cergy-Pontoise, Neuville sur Oise, France, E-mail: huillet@ptm.u-cergy.fr;MODAL'X, Université de Paris 10 Nanterre, 92001 Nanterre Cédex, France, E-mail: cparoiss@u-paris10.fr
Venue:
Probability in the Engineering and Informational Sciences
Year:
2005

Citing 4
Cited 2

Birthday paradox, coupon collectors, caching algorithms and self-organizing search

Discrete Applied Mathematics
On the distribution of search cost for the move-to-front rule

Random Structures & Algorithms
Limits and rates of convergence for the distribution of search cost under the move-to-front rule

Theoretical Computer Science
ON A CONJECTURE OF FILL AND HOLST INVOLVING THE MOVE-TO-FRONT RULE AND CACHE FAULTS

Probability in the Engineering and Informational Sciences

Dirichlet Bridge Sampling for the Variance Gamma Process: Pricing Path-Dependent Options

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the random Dirichlet partition of the interval into n fragments at temperature θ 0. Explicit results on the law of its size-biased permutation are first supplied. Using these, new results on the comparative search cost distributions from Dirichlet partition and from its size-biased permutation are obtained.