A Central Limit Theorem for Non-Overlapping Return Times
From MaRDI portal
Publication:5488986
DOI10.1239/jap/1143936241zbMath1100.94010arXivmath/0506165OpenAlexW3103212843WikidataQ60522095 ScholiaQ60522095MaRDI QIDQ5488986
Publication date: 25 September 2006
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0506165
Central limit and other weak theorems (60F05) Measures of association (correlation, canonical correlation, etc.) (62H20) Measures of information, entropy (94A17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- A diffusion limit for a class of randomly-growing binary trees
- Normal fluctuations and the FKG inequalities
- Entropy and prefixes
- A universal statistical test for random bit generators
- Asymptotic recurrence and waiting times for stationary processes
- String matching bounds via coding
- Further developments on sufficient conditions for negative dependence of random variables.
- More on recurrence and waiting times
- Negative association of random variables, with applications
- The recurrence of blocks for Bernoulli processes
- Sharp error terms and necessary conditions for exponential hitting times in mixing processes.
- Exponential distribution for the occurrence of rare patterns in Gibbsian random fields
- Coding theorems for individual sequences
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Entropy and data compression schemes
- A version of Maurer's conjecture for stationary -mixing processes
- An Entropy Estimator for a Class of Infinite Alphabet Processes
- Random Generators and Normal Numbers
- On the notion of recurrence in discrete stochastic processes
This page was built for publication: A Central Limit Theorem for Non-Overlapping Return Times
