Almost-sure waiting time results for weak and very weak Bernoulli processes

DOI10.1017/S0143385700009706zbMath0830.60023WikidataQ105583854 ScholiaQ105583854MaRDI QIDQ4854162

Paul C. Shields, Katalin Marton

Publication date: 15 January 1996

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

zbMATH Keywords

entropyalmost-sure convergenceweak Bernoulli processesvery weak Bernoulli processes

Mathematics Subject Classification ID

Point estimation (62F10) Strong limit theorems (60F15) Foundations of stochastic processes (60G05)

Related Items (7)

Coalescence and meeting times on \(n\)-block Markov chains ⋮ Convergence of recurrence of blocks for mixing processes ⋮ The multifractal spectra of certain planar recurrence sets in the continued fraction dynamical system ⋮ The waiting spectra of the sets described by the quantitative waiting time indicators ⋮ Loose almost blowing-up and related properties ⋮ From the divergence between two measures to the shortest path between two observables ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

Cites Work

• Waiting times: Positive and negative results on the Wyner-Ziv problem
• How sampling reveals a process
• The positive-divergence and blowing-up properties
• Entropy and the consistent estimation of joint distributions
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• A recurrence theorem for dependent processes with applications to data compression
• Convergence of stochastic processes

This page was built for publication: Almost-sure waiting time results for weak and very weak Bernoulli processes