More on recurrence and waiting times
From MaRDI portal
Publication:1578578
DOI10.1214/aoap/1029962813zbMath0955.60031OpenAlexW2064652902WikidataQ105584826 ScholiaQ105584826MaRDI QIDQ1578578
Publication date: 4 September 2000
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1029962813
Related Items (6)
Matching strings in encoded sequences ⋮ Convergence of recurrence of blocks for mixing processes ⋮ Maximal clusters in non-critical percolation and related models ⋮ Occurrence, repetition and matching of patterns in the low-temperature Ising model ⋮ From the divergence between two measures to the shortest path between two observables ⋮ A Central Limit Theorem for Non-Overlapping Return Times
Cites Work
- Unnamed Item
- Unnamed Item
- Waiting times: Positive and negative results on the Wyner-Ziv problem
- Entropy and prefixes
- Compound Poisson approximation for nonnegative random variables via Stein's method
- Asymptotic recurrence and waiting times for stationary processes
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Entropy and data compression schemes
- The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
- On the role of pattern matching in information theory
This page was built for publication: More on recurrence and waiting times