A Central Limit Theorem for Non-Overlapping Return Times

DOI10.1239/JAP/1143936241zbMATH Open1100.94010arXivmath/0506165OpenAlexW3103212843WikidataQ60522095 ScholiaQ60522095MaRDI QIDQ5488986FDOQ5488986

Authors: Oliver Johnson 

Publication date: 25 September 2006

Published in: Journal of Applied Probability (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/math/0506165

Recommendations

• Entry and return times distribution
• Statistics of return times: A general framework and new applications
• Convergence of recurrence of blocks for mixing processes
• Exponential return times in a zero-entropy process
• The recurrence of blocks for Bernoulli processes

zbMATH Keywords

central limit theorementropy estimationreturn timenegative associationmatch length

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Central limit and other weak theorems (60F05) Measures of information, entropy (94A17)

Cites Work

• Title not available (Why is that?)
• A universal statistical test for random bit generators
• Title not available (Why is that?)
• Negative association of random variables, with applications
• On the notion of recurrence in discrete stochastic processes
• A diffusion limit for a class of randomly-growing binary trees
• Normal fluctuations and the FKG inequalities
• Sharp error terms and necessary conditions for exponential hitting times in mixing processes.
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Entropy and data compression schemes
• Random Generators and Normal Numbers
• Asymptotic recurrence and waiting times for stationary processes
• More on recurrence and waiting times
• The recurrence of blocks for Bernoulli processes
• A version of Maurer's conjecture for stationary  -mixing processes
• Coding theorems for individual sequences
• Title not available (Why is that?)
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• Further developments on sufficient conditions for negative dependence of random variables.
• Entropy and prefixes
• Exponential distribution for the occurrence of rare patterns in Gibbsian random fields
• String matching bounds via coding
• An Entropy Estimator for a Class of Infinite Alphabet Processes
• Title not available (Why is that?)

Cited In (5)

• Convergence of recurrence of blocks for mixing processes
• The distribution of the short-return function
• The general asymptotic return-time process
• The recurrence of blocks for Bernoulli processes
• Breaking the duality in the return times theorem

This page was built for publication: A Central Limit Theorem for Non-Overlapping Return Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488986)