Paper 2011/298

Local limit theorem for large deviations and statistical box-tests

Igor Semaev

Abstract

Let n particles be independently allocated into N boxes, where the l-th box appears with the probability al. Let μr be the number of boxes with exactly r particles and μ=[μr1,,μrm]. Asymptotical behavior of such random variables as N tends to infinity was studied by many authors. It was previously known that if Nal are all upper bounded and n/N is upper and lower bounded by positive constants, then μ tends in distribution to a multivariate normal low. A stronger statement, namely a large deviation local limit theorem for μ under the same condition, is here proved. Also all cumulants of μ are proved to be O(N). Then we study the hypothesis testing that the box distribution is uniform, denoted , with a recently introduced box-test. Its statistic is a quadratic form in variables . For a wide area of non-uniform , an asymptotical relation for the power of the quadratic and linear box-tests, the statistics of the latter are linear functions of , is proved. In particular, the quadratic test asymptotically is at least as powerful as any of the linear box-tests, including the well-known empty-box test if is in .

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functions
Contact author(s)
igor @ ii uib no
History
2011-06-08: received
Short URL
https://ia.cr/2011/298
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/298,
      author = {Igor Semaev},
      title = {Local limit theorem for large deviations  and statistical box-tests},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/298},
      year = {2011},
      url = {https://eprint.iacr.org/2011/298}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.