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

DOI10.1017/S0269964805050060zbMATH Open1077.60005OpenAlexW2156753397MaRDI QIDQ4673902FDOQ4673902

Authors: Javiera Barrera, Christian Paroissin, 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

Recommendations

• scientific article; zbMATH DE number 5311837
• Unordered and ordered sample from Dirichlet distribution
• Sampling Formulae Arising from Random Dirichlet Populations
• Random discrete distributions invariant under size-biased permutation
• Random partitioning models arising from size-biased picking

zbMATH Keywords

random partition

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

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

Cited In (9)

• Unordered and ordered sample from Dirichlet distribution
• 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
• Estimations of the parameter of a Dirichlet distribution using residual allocation model representations and sampling properties
• Random partitioning models arising from size-biased picking
• Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
• Trapezoidal and Simpson's methods with a random design
• Interval Partitioning Arising from Size-Biased Picking
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673902)