Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Aristides V. Doumas"'
Publikováno v:
Acta Mathematica Sinica, English Series. 36:1357-1383
A collector samples coupons with replacement from a pool containing $g$ \textit{uniform} groups of coupons, where "uniform group" means that all coupons in the group are equally likely to occur. For each $j = 1, \dots, g$ let $T_j$ be the number of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a659740c8cd6f8e5afd993472b77717e
https://doi.org/10.1007/s10114-020-9425-y
https://doi.org/10.1007/s10114-020-9425-y
Publikováno v:
ESAIM: Probability and Statistics. 24:275-293
The origin of power-law behavior (also known variously as Zipf’s law) has been a topic of debate in the scientific community for more than a century. Power laws appear widely in physics, biology, earth and planetary sciences, economics and finance,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::842d9c9c7464998fa428e8b0baf8efa9
https://doi.org/10.1051/ps/2020011
https://doi.org/10.1051/ps/2020011
Publikováno v:
Teoriya Veroyatnostei i ee Primeneniya. 62:556-586
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80894aef1a9e717e4d00e32e5f1d37db
https://doi.org/10.4213/tvp5129
https://doi.org/10.4213/tvp5129
Publikováno v:
Statistics & Probability Letters. 109:39-44
We consider a Markov chain on the positive odd integers, which can be viewed as a stochastic version of the Collatz 3 x + 1 Problem. We show that, no matter its initial value, the chain visits 1 infinitely often. Its values, however, are unbounded.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af5a44b7362203d93e212771d1dd3852
https://doi.org/10.1016/j.spl.2015.10.017
https://doi.org/10.1016/j.spl.2015.10.017
Publikováno v:
Stochastic Models. 30:125-141
□ We calculate the asymptotics of the moments as well as the limiting distribution (after the appropriate normalization) of the maximum of independent, not identically distributed, geometric random variables. In many cases, the limit distribution t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5004f69ef695ff4ab1003d46efe4c71e
https://doi.org/10.1080/15326349.2014.868742
https://doi.org/10.1080/15326349.2014.868742
Publikováno v:
Statistics & Probability Letters. 155:108559
We consider the following variant of the classic collector's problem: The family of coupon probabilities is the mixing of two subfamilies one of which is the \textit{uniform} family, while the other belongs to the well known \textit{Zipf family}. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ea2b701ff44277108fcbfde756fbf6c
https://doi.org/10.1016/j.spl.2019.108559
https://doi.org/10.1016/j.spl.2019.108559
Autor:
Aristides V. Doumas
Publikováno v:
The Mathematical Gazette. 97:446-454
Suppose n (fair) dice each having m faces marked with numbers 1 to m, are thrown at random. The problem of determining the number of ways in which the sum of the numbers exhibited by the dice will be equal to a given number k has a very long history.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fb762acabd4e01b3871d8f663186064
https://doi.org/10.1017/s002555720000019x
https://doi.org/10.1017/s002555720000019x
The "double Dixie cup problem" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number $T_{m}(N)$ of coupons that a collector has to buy in order to complete $m$ sets of al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae39e1a47da4fc3ba3595ebccc3d344a
Publikováno v:
Electron. J. Probab.
We develop techniques of computing the asymptotics of the moments of the number $T_N$ of coupons that a collector has to buy in order to find all $N$ existing different coupons as $N\rightarrow \infty.$ The probabilities (occurring frequencies) of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c16a9b0ef3c74508405928a9d9d2bf1
http://projecteuclid.org/euclid.ejp/1465064266
http://projecteuclid.org/euclid.ejp/1465064266
Publikováno v:
Adv. in Appl. Probab. 44, no. 1 (2012), 166-195
We develop techniques for computing the asymptotics of the first and second moments of the number T N of coupons that a collector has to buy in order to find all N existing different coupons as N → ∞. The probabilities (occurring frequencies) of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::563fa2447b0f3623367ac7138fb39c65
http://projecteuclid.org/euclid.aap/1331216649
http://projecteuclid.org/euclid.aap/1331216649