Dynamical intricacy and average sample complexity
From MaRDI portal
Publication:5375959
DOI10.1080/14689367.2017.1374352zbMath1397.37017arXiv1512.01143OpenAlexW2963346841MaRDI QIDQ5375959
No author found.
Publication date: 17 September 2018
Published in: Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.01143
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Dynamical intricacy and average sample complexity for random bundle transformations ⋮ Dynamical intricacy and average sample complexity of amenable group actions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate maximizers of intricacy functionals
- Entropy is the only finitely observable invariant
- Ergodic theory on compact spaces
- Sequence entropy and mixing
- Coding sequence density estimation via topological pressure
- Infinite-to-One Codes and Markov Measures
- A Relativised Variational Principle for Continuous Transformations
- Measures of maximal relative entropy
- Relative Pressure, Relative Equilibrium States, Compensation Functions and Many-to-One Codes Between Subshifts
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
- An Introduction to Symbolic Dynamics and Coding
- Topological Entropy
- ON METRIC INVARIANTS OF ENTROPY TYPE
- LECTURES ON THE ENTROPY THEORY OF MEASURE-PRESERVING TRANSFORMATIONS
- On sequence entropy. I.
- Entropy for Group Endomorphisms and Homogeneous Spaces
- On sequence entropy of automorphisms of a Lebesgue space
- Structure of transition classes for factor codes on shifts of finite type
This page was built for publication: Dynamical intricacy and average sample complexity
