arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0506165math.PR
收藏

A Central Limit Theorem for non-overlapping return times

Oliver Johnson

英文摘要:

Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy estimation, and to the problem of determining if digits have come from an independent equidistribted sequence. In the case of an equidistributed sequence, we use an argument based on negative association to prove convergence under weaker conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑