The Bernoulli sieve

Bernoulli

Volumn 10, Issue 1, 2004, Pages 79-96

  Gnedin, Alexander V ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Composition; Renewal; Sampling; Stick breaking

Indexed keywords

EID: 17044432492     PISSN: 13507265     EISSN: None     Source Type: Journal    
DOI: 10.3150/bj/1077544604     Document Type: Article

References (19)

1. Arratia, R., Barbour, A.G. and Tavaré, S. (2002) Logarithmic Combinatorial Structures: A Probabilistic Approach. To appear.
2. Bruhn, V (1996) Eine Methode zur asymptotischen Behandlung einer Klasse von Rekursionsgleichungen mit einer Anwendung in der stochastischen Analyse des Quicksort-Algorithmus. Doctoral dissertation, Universität zu Kiel.
3. Bruss, T. and O'Cinneide, C. (1990) On the maximum and its uniqueness for geometric random samples. J. Appl. Probab., 27, 598-610.
4. Evvens, W.J. and Tavaré, S. (1997) The Ewens sampling formula. In N.S. Johnson, S. Kotz and N. Balakrishnan (eds), Discrete Midtivariate Distributions. New York: Wiley.
5. Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. 2, 2nd edn. New York: Wiley.
6. Flajolet, P. (1999) Singularity analysis and asymptotics of Bernoulli sums. Theoret. Comput. Sci., 215, 371-381.
7. Gnedin, A.V. (1997) The representation of composition structures. Ann. Probab., 25, 1437-1450.
8. Gnedin, A.V. (1998) On the Poisson-Dirichlet limit. J. Multivariate Anal., 67, 90-98.
9. Gnedin, A.V. (2003) Three sampling formulas. Combin. Probab. Comput. To appear.
10. Gnedin, A.V. and Pitman, J. (2003) Regenerative composition structures. Technical report 644, Dept. of Statistics, University of California at Berkeley.
11. Gnedin, A.V., Pitman, J. and Yor, M. (2003) Asymptotic laws for regenerative composition structures. In progress.
12. Jacquet, P. and Szpankowski, W. (1999) Entropy computations via analytic depoissonization. IEEE Trans. Inform. Theory, 45, 1072-1081.
13. Karlin, S. (1967) Central limit theorems for certain infinite urn schemes. J. Math. Mech., 17, 373-401.
14. Kirschenhofer, P. and Prodinger, H. (1996) The number of winners in a discrete geometrically distributed sample. Ann. Appl. Probab., 6, 687-694.
15. Lorenz, G. (1953) Bernstein Polynomials. Toronto: University of Toronto Press.
16. Neininger, R. and Rüschendorf, L. (2002) On the contraction method with degenerate limit equations. Preprint.
17. Pitman, J. (2002) Combinatorial stochastic processes. Technical report 621, Dept. of Statistics, University of California at Berkeley.
18. Rösler, U. (2001) On the analysis of stochastic divide and conquer algorithms. Algorithmica, 29, 238-261.
19. Rösler, U. and Rüschendorf, L. (2001) The contraction method for recursive algorithms. Algorithmica, 29, 3-33.