Dynamical intricacy and average sample complexity

DOI10.1080/14689367.2017.1374352MaRDI QIDQ5375959zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

complexityentropyergodic theoryintricacytopological dynamics

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Topological entropy (37B40)

Abstract: We propose a new way to measure the balance between freedom and coherence in a dynamical system and a new measure of its internal variability. Based on the concept of entropy and ideas from neuroscience and information theory, we define emph{intricacy} and emph{average sample complexity} for topological and measure-preserving dynamical systems. We establish basic properties of these quantities, show that their suprema over covers or partitions equal the ordinary entropies, compute them for many shifts of finite type, and indicate natural directions for further research.

Recommendations

• Dynamical intricacy and average sample complexity for random bundle transformations
• Complexity for extended dynamical systems
• Dynamical intricacy and average sample complexity of amenable group actions
• Approximate maximizers of intricacy functionals
• Complexity of dynamics as variability of predictability

Cites work

• A Relativised Variational Principle for Continuous Transformations
• An Introduction to Symbolic Dynamics and Coding
• Approximate maximizers of intricacy functionals
• Coding sequence density estimation via topological pressure
• Entropy for Group Endomorphisms and Homogeneous Spaces
• Entropy is the only finitely observable invariant
• Ergodic theory on compact spaces
• scientific article; zbMATH DE number 44107 (Why is no real title available?)
• scientific article; zbMATH DE number 1542660 (Why is no real title available?)
• Infinite-to-One Codes and Markov Measures
• LECTURES ON THE ENTROPY THEORY OF MEASURE-PRESERVING TRANSFORMATIONS
• Maximal pattern complexity for discrete systems
• Measures of maximal relative entropy
• ON METRIC INVARIANTS OF ENTROPY TYPE
• On sequence entropy of automorphisms of a Lebesgue space
• On sequence entropy. I.
• Relative Pressure, Relative Equilibrium States, Compensation Functions and Many-to-One Codes Between Subshifts
• Sequence entropy and mixing
• Sequence entropy and the maximal pattern complexity of infinite words
• Structure of transition classes for factor codes on shifts of finite type
• Topological Entropy

Cited in

(7)

• Dynamical intricacy and average sample complexity of amenable group actions
• Mean mutual information and symmetry breaking for finite random fields
• Dynamical intricacy and average sample complexity for random bundle transformations
• Ergodic parameters and dynamical complexity
• The pressure of intricacy and average sample complexity for amenable group actions
• Local intricacy and average sample complexity for amenable group actions
• Approximate maximizers of intricacy functionals

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Dynamical intricacy and average sample complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375959)