Article contents
A Central Limit Theorem for Non-Overlapping Return Times
Published online by Cambridge University Press: 14 July 2016
Abstract
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 entropy estimation, and to the problem of determining if digits have come from an independent, equidistributed sequence. In the case of an equidistributed sequence, we use an argument based on negative association to prove convergence under conditions weaker than those required in the general case.
MSC classification
- Type
- Research Papers
- Information
- Copyright
- © Applied Probability Trust 2006
References
- 1
- Cited by