The asymptotics of waiting times between stationary processes, allowing distortion

DOI10.1214/aoap/1029962749zbMath0940.60033OpenAlexW2083263610MaRDI QIDQ1305418

Ioannis Kontoyiannis, Amir Dembo

Publication date: 19 July 2000

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

Full work available at URL: https://doi.org/10.1214/aoap/1029962749

zbMATH Keywords

relative entropywaiting timelarge deviationsstrong approximationmixing conditionstring matchingDNA sequence analysis

Mathematics Subject Classification ID

Strong limit theorems (60F15) Large deviations (60F10) Measures of information, entropy (94A17)

Related Items (6)

Stochastic sub-additivity approach to the conditional large deviation principle ⋮ Matching strings in encoded sequences ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Large deviations for independent random variables – Application to Erdös-Renyi's functional law of large numbers ⋮ Large deviations for template matching between point processes ⋮ On approximate pattern matching for a class of Gibbs random fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Waiting times: Positive and negative results on the Wyner-Ziv problem
• Maximal length of common words among random letter sequences
• Invariance principle and empirical mean large deviations of the critical Ornstein-Uhlenbeck process
• Asymptotic recurrence and waiting times for stationary processes
• A phase transition for the score in matching random sequences allowing deletions
• The functional law of the iterated logarithm for stationary strongly mixing sequences
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Almost sure invariance principles for partial sums of weakly dependent random variables
• An algorithm for source coding subject to a fidelity criterion, based on string matching
• Asymptotic properties of data compression and suffix trees
• A suboptimal lossy data compression based on approximate pattern matching
• On the performance of data compression algorithms based upon string matching
• Almost-sure waiting time results for weak and very weak Bernoulli processes
• An invariance principle for the law of the iterated logarithm
• Relations between Weak and Uniform Convergence of Measures with Applications
• Some Limit Theorems for Stationary Processes

This page was built for publication: The asymptotics of waiting times between stationary processes, allowing distortion