Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Oliver Johnson"'
Publikováno v:
Electron. J. Probab. 15 (2010), 1344-1369
An information-theoretic development is given for the problem of compound Poisson approximation, which parallels earlier treatments for Gaussian and Poisson approximation. Let $P_{S_n}$ be the distribution of a sum $S_n=\Sumn Y_i$ of independent inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a67fa0c5873d1d1952988e3f905ee27e
Autor:
Oliver Johnson
Define the non-overlapping return time of a block of a random process to be the number of blocks that pass by before the block in question reappears. We prove a central limit theorem based on these return times. This result has applications to entrop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18805616efc1e15491bfc773f8f315a2
http://arxiv.org/abs/math/0506165
http://arxiv.org/abs/math/0506165
Autor:
Richard J. Samworth, Oliver Johnson
Publikováno v:
University of Bristol-PURE
Bernoulli 11, no. 5 (2005), 829-845
Bernoulli 12, no. 1 (2006), 191
Bernoulli 11, no. 5 (2005), 829-845
Bernoulli 12, no. 1 (2006), 191
We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality related t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::256b39aec6afd1e5bf300695648b102a
http://arxiv.org/abs/math/0406218
http://arxiv.org/abs/math/0406218