Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Oliver Johnson"'
Publikováno v:
Yu, L, Daly, F & Johnson, O T 2022, ' A negative binomial approximation in group testing ', Probability in the Engineering and Informational Sciences . https://doi.org/10.1017/S026996482200033X
We consider the problem of group testing (pooled testing), first introduced by Dorfman. For nonadaptive testing strategies, we refer to a nondefective item as “intruding” if it only appears in positive tests. Such items cause misclassification er
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa457e75d06a2e1753ab1bc282608e80
http://arxiv.org/abs/2203.07803
http://arxiv.org/abs/2203.07803
Autor:
Erwan Hillion, Oliver Johnson
Publikováno v:
Hillion, E & Johnson, O T 2019, ' A proof of the Shepp-Olkin entropy monotonicity conjecture ', Electronic Journal of Probability, vol. 24, 126 . https://doi.org/10.1214/19-EJP380
Electron. J. Probab.
Electron. J. Probab.
Consider tossing a collection of coins, each fair or biased towards heads, and take the distribution of the total number of heads that result. It is natural to conjecture that this distribution should be 'more random' when each coin is fairer. Indeed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f86d62501ce87cfb6ef6a660074a11c
https://hal.science/hal-02113623
https://hal.science/hal-02113623
Autor:
Oliver Johnson, Ramji Venkataramanan
Publikováno v:
Electron. J. Statist. 12, no. 1 (2018), 1126-1149
Venkataramanan, R & Johnson, O 2018, ' A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ', Electronic Journal of Statistics, vol. 12, no. 1, pp. 1126-1149 . https://doi.org/10.1214/18-EJS1419
Venkataramanan, R & Johnson, O 2018, ' A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ', Electronic Journal of Statistics, vol. 12, no. 1, pp. 1126-1149 . https://doi.org/10.1214/18-EJS1419
In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an informati
Autor:
Oliver Johnson
Publikováno v:
Ann. Inst. H. Poincaré Probab. Statist. 53, no. 4 (2017), 1952-1970
Johnson, O 2017, ' A discrete log-Sobolev inequality under a Bakry-Émery type condition ', Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, vol. 53, no. 4, pp. 1952-1970 . https://doi.org/10.1214/16-AIHP778
Johnson, O 2017, ' A discrete log-Sobolev inequality under a Bakry-Émery type condition ', Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, vol. 53, no. 4, pp. 1952-1970 . https://doi.org/10.1214/16-AIHP778
Nous considerons des distributions de probabilite $V$ a support dans l’ensemble des entiers positifs, en utilisant des arguments introduits par Caputo, Dai Pra et Posta, bases sur une condition de Bakry–Emery pour une chaine de naissance et mort
Given the output of a data source taking values in a finite alphabet, we wish to detect change-points, that is times when the statistical properties of the source change. Motivated by ideas of match lengths in information theory, we introduce a novel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4fe7c6462966c91f1122b38847746e5
http://arxiv.org/abs/1106.5714
http://arxiv.org/abs/1106.5714
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