Skip to main content

2016 | OriginalPaper | Buchkapitel

5. Application to the Bernoulli Sieve

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The definition of the Bernoulli sieve which is an infinite allocation scheme can be found on p. 1. Assuming that the number of balls to be allocated equals n (in other words, using a sample of size n from a uniform distribution on [0, 1]), denote by K n the number of occupied boxes and by M n the index of the last occupied box. Also, put L n : = M n K n and note that L n equals the number of empty boxes within the occupancy range (i.e., we only count the empty boxes with indices not exceeding M n ).

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
7.
Zurück zum Zitat G. Alsmeyer, A. Iksanov and A. Marynych, Functional limit theorems for the number of occupied boxes in the Bernoulli sieve. Stoch. Proc. Appl., to appear (2017). G. Alsmeyer, A. Iksanov and A. Marynych, Functional limit theorems for the number of occupied boxes in the Bernoulli sieve. Stoch. Proc. Appl., to appear (2017).
22.
Zurück zum Zitat R. R. Bahadur, On the number of distinct values in a large sample from an infinite discrete distribution. Proc. Nat. Inst. Sci. India. 26A (1960), 66–75.MathSciNetMATH R. R. Bahadur, On the number of distinct values in a large sample from an infinite discrete distribution. Proc. Nat. Inst. Sci. India. 26A (1960), 66–75.MathSciNetMATH
23.
Zurück zum Zitat A. D. Barbour, Univariate approximations in the infinite occupancy scheme. Alea, Lat. Am. J. Probab. Math. Stat. 6 (2009), 415–433. A. D. Barbour, Univariate approximations in the infinite occupancy scheme. Alea, Lat. Am. J. Probab. Math. Stat. 6 (2009), 415–433.
24.
45.
Zurück zum Zitat L. V. Bogachev, A. V. Gnedin and Yu. V. Yakubovich, On the variance of the number of occupied boxes. Adv. Appl. Math. 40 (2008), 401–432.MathSciNetCrossRefMATH L. V. Bogachev, A. V. Gnedin and Yu. V. Yakubovich, On the variance of the number of occupied boxes. Adv. Appl. Math. 40 (2008), 401–432.MathSciNetCrossRefMATH
72.
Zurück zum Zitat D. A. Darling, Some limit theorems assiciated with multinomial trials. Proc. Fifth Berkeley Symp. on Math. Statist. and Probab. 2 (1967), 345–350. D. A. Darling, Some limit theorems assiciated with multinomial trials. Proc. Fifth Berkeley Symp. on Math. Statist. and Probab. 2 (1967), 345–350.
79.
Zurück zum Zitat O. Durieu and Y. Wang, From infinite urn schemes to decompositions of self-similar Gaussian processes. Electron. J. Probab. 21 (2016), paper no. 43, 23 pp. O. Durieu and Y. Wang, From infinite urn schemes to decompositions of self-similar Gaussian processes. Electron. J. Probab. 21 (2016), paper no. 43, 23 pp.
90.
Zurück zum Zitat Sh. K. Formanov and A. Asimov, A limit theorem for the separable statistic in a random assignment scheme. J. Sov. Math. 38 (1987), 2405–2411.CrossRefMATH Sh. K. Formanov and A. Asimov, A limit theorem for the separable statistic in a random assignment scheme. J. Sov. Math. 38 (1987), 2405–2411.CrossRefMATH
98.
Zurück zum Zitat A. Gnedin, A. Hansen and J. Pitman, Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probab. Surv. 4 (2007), 146–171.MathSciNetCrossRefMATH A. Gnedin, A. Hansen and J. Pitman, Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probab. Surv. 4 (2007), 146–171.MathSciNetCrossRefMATH
99.
Zurück zum Zitat A. Gnedin and A. Iksanov, Regenerative compositions in the case of slow variation: A renewal theory approach. Electron. J. Probab. 17 (2012), paper no. 77, 19 pp. A. Gnedin and A. Iksanov, Regenerative compositions in the case of slow variation: A renewal theory approach. Electron. J. Probab. 17 (2012), paper no. 77, 19 pp.
100.
Zurück zum Zitat A. Gnedin, A. Iksanov and A. Marynych, Limit theorems for the number of occupied boxes in the Bernoulli sieve. Theory Stochastic Process. 16(32) (2010), 44–57.MathSciNetMATH A. Gnedin, A. Iksanov and A. Marynych, Limit theorems for the number of occupied boxes in the Bernoulli sieve. Theory Stochastic Process. 16(32) (2010), 44–57.MathSciNetMATH
101.
Zurück zum Zitat A. Gnedin, A. Iksanov, and A. Marynych, The Bernoulli sieve: an overview. In Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), Discrete Math. Theor. Comput. Sci. AM (2010), 329–341. A. Gnedin, A. Iksanov, and A. Marynych, The Bernoulli sieve: an overview. In Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), Discrete Math. Theor. Comput. Sci. AM (2010), 329–341.
103.
Zurück zum Zitat A. Gnedin, A. Iksanov and A. Marynych, A generalization of the Erdős-Turán law for the order of random permutation. Combin. Probab. Comput. 21 (2012), 715–733.MathSciNetCrossRefMATH A. Gnedin, A. Iksanov and A. Marynych, A generalization of the Erdős-Turán law for the order of random permutation. Combin. Probab. Comput. 21 (2012), 715–733.MathSciNetCrossRefMATH
104.
Zurück zum Zitat A. Gnedin, A. Iksanov, P. Negadailov and U. Rösler, The Bernoulli sieve revisited. Ann. Appl. Probab. 19 (2009), 1634–1655.MathSciNetCrossRefMATH A. Gnedin, A. Iksanov, P. Negadailov and U. Rösler, The Bernoulli sieve revisited. Ann. Appl. Probab. 19 (2009), 1634–1655.MathSciNetCrossRefMATH
105.
Zurück zum Zitat A. Gnedin, A. Iksanov and U. Roesler, Small parts in the Bernoulli sieve. In Proceedings of the Fifth Colloquium on Mathematics and Computer Science, Discrete Math. Theor. Comput. Sci. Proc. AI (2008), 235–242. A. Gnedin, A. Iksanov and U. Roesler, Small parts in the Bernoulli sieve. In Proceedings of the Fifth Colloquium on Mathematics and Computer Science, Discrete Math. Theor. Comput. Sci. Proc. AI (2008), 235–242.
130.
138.
139.
Zurück zum Zitat A. Iksanov, On the number of empty boxes in the Bernoulli sieve I. Stochastics. 85 (2013), 946–959.MathSciNetMATH A. Iksanov, On the number of empty boxes in the Bernoulli sieve I. Stochastics. 85 (2013), 946–959.MathSciNetMATH
150.
Zurück zum Zitat A. M. Iksanov, A. V. Marynych and V. A. Vatutin, Weak convergence of finite-dimensional distributions of the number of empty boxes in the Bernoulli sieve. Theory Probab. Appl. 59 (2015), 87–113.MathSciNetCrossRefMATH A. M. Iksanov, A. V. Marynych and V. A. Vatutin, Weak convergence of finite-dimensional distributions of the number of empty boxes in the Bernoulli sieve. Theory Probab. Appl. 59 (2015), 87–113.MathSciNetCrossRefMATH
171.
Zurück zum Zitat S. Karlin, Central limit theorems for certain infinite urn schemes. J. Math. Mech. 17 (1967), 373–401.MathSciNetMATH S. Karlin, Central limit theorems for certain infinite urn schemes. J. Math. Mech. 17 (1967), 373–401.MathSciNetMATH
184.
Zurück zum Zitat V. F. Kolchin, B. A. Sevastyanov and V. P. Chistyakov, Random allocations. V.H.Winston & Sons, 1978. V. F. Kolchin, B. A. Sevastyanov and V. P. Chistyakov, Random allocations. V.H.Winston & Sons, 1978.
211.
Zurück zum Zitat V. G. Mikhailov, The central limit theorem for a scheme of independent allocation of particles by cells. Proc. Steklov Inst. Math. 157 (1983), 147–163. V. G. Mikhailov, The central limit theorem for a scheme of independent allocation of particles by cells. Proc. Steklov Inst. Math. 157 (1983), 147–163.
215.
Zurück zum Zitat Sh. A. Mirakhmedov, Randomized decomposable statistics in a generalized allocation scheme over a countable set of cells. Diskret. Mat. 1 (1989), 46–62 (in Russian).MathSciNetMATH Sh. A. Mirakhmedov, Randomized decomposable statistics in a generalized allocation scheme over a countable set of cells. Diskret. Mat. 1 (1989), 46–62 (in Russian).MathSciNetMATH
216.
Zurück zum Zitat Sh. A. Mirakhmedov, Randomized decomposable statistics in a scheme of independent allocation of particles into cells. Diskret. Mat. 2 (1990), 97–111 (in Russian).MathSciNetMATH Sh. A. Mirakhmedov, Randomized decomposable statistics in a scheme of independent allocation of particles into cells. Diskret. Mat. 2 (1990), 97–111 (in Russian).MathSciNetMATH
262.
Zurück zum Zitat E. T. Whittaker and G. N. Watson, A course of modern analysis. 4th Edition reprinted, Cambridge University Press, 1950. E. T. Whittaker and G. N. Watson, A course of modern analysis. 4th Edition reprinted, Cambridge University Press, 1950.
Metadaten
Titel
Application to the Bernoulli Sieve
verfasst von
Alexander Iksanov
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-49113-4_5