SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION

DOI10.1017/S0269964805050060zbMath1077.60005OpenAlexW2156753397MaRDI QIDQ4673902

Christian Paroissin, Javiera Barrera, Thierry E. Huillet

Publication date: 9 May 2005

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964805050060

zbMATH Keywords

random partition

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (6)

Limiting behavior of the search cost distribution for the move-to-front rule in the stable case ⋮ Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process ⋮ Limiting search cost distribution for the move-to-front rule with random request probabilities ⋮ The limiting move-to-front search-cost in law of large numbers asymptotic regimes ⋮ Estimations of the parameter of a Dirichlet distribution using residual allocation model representations and sampling properties ⋮ Unordered and ordered sample from Dirichlet distribution

Cites Work

• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Partition structures, Polya urns, the Ewens sampling formula, and the ages of alleles
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• The heaps process, libraries, and size-biased permutations
• Random partitions in population genetics
• On a model for storage and search
• On the distribution of the search cost for the move-to-front rule with random weights

This page was built for publication: SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION