Entrance time and Rényi entropy
From MaRDI portal
Publication:3453147
Abstract: For ergodic systems with generating partitions, the well known result of Ornstein and Weiss shows that the exponential growth rate of the recurrence time is almost surely equal to the metric entropy. Here we look at the exponential growth rate of entrance times, and show that it equals the entropy, where the convergence is in probability in the product measure. This is however under the assumptions that the limiting entrance times distribution exists almost surely. This condition looks natural in the light of an example by Shields in which the limsup in the exponential growth rate is infinite almost everywhere but where the limiting entrance times do not exist. We then also consider -mixing systems and prove a result connecting the R'enyi entropy to sums over the entrance times orbit segments.
Recommendations
Cites work
- A Note on the Ergodic Theorem of Information Theory
- Entropy and data compression schemes
- Entropy and recurrence rates for stationary random fields
- Hitting and return times in ergodic dynamical systems
- Pressure and recurrence
- Rényi entropy and recurrence
- Sharp error terms and necessary conditions for exponential hitting times in mixing processes.
- The Rényi entropy function and the large deviation of short return times
- Two Remarks on the Basic Theorems of Information Theory.
- Waiting times: Positive and negative results on the Wyner-Ziv problem
Cited in
(3)
This page was built for publication: Entrance time and Rényi entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453147)