Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction
arXiv:1705.08042 · doi:10.1063/1.4985199
Abstract
Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type of question---correlation, predictability, predictive cost, observer synchronization, and the like---induces a distinct generator class. Answers are then functions of the class-appropriate transition dynamic. Unfortunately, these dynamics are generically nonnormal, nondiagonalizable, singular, and so on. Tractably analyzing these dynamics relies on adapting the recently introduced meromorphic functional calculus, which specifies the spectral decomposition of functions of nondiagonalizable linear operators, even when the function poles and zeros coincide with the operator's spectrum. Along the way, we establish special properties of the projection operators that demonstrate how they capture the organization of subprocesses within a complex system. Circumventing the spurious infinities of alternative calculi, this leads in the sequel, Part II, to the first closed-form expressions for complexity measures, couched either in terms of the Drazin inverse (negative-one power of a singular operator) or the eigenvalues and projection operators of the appropriate transition dynamic.
arXiv comment24 pages, 3 figures, 4 tables; current version always at http://csc.ucdavis.edu/~cmg/compmech/pubs/sdscpt1.htm
References in corpus (18)
- Stochastic thermodynamics, fluctuation theorems, and molecular machines
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Synchronization is optimal in non-diagonalizable networks
- Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information
- Anatomy of a Bit: Information in a Time Series Observation
- Prediction, Retrodiction, and The Amount of Information Stored in the Present
- Hidden Markov models for stochastic thermodynamics
- Exact Synchronization for Finite-State Sources
- Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
- Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation
- Leveraging Environmental Correlations: The Thermodynamics of Requisite Variety
- Nearly Maximally Predictive Features and Their Dimensions
- Structure and Randomness of Continuous-Time Discrete-Event Processes
- How Hidden are Hidden Processes? A Primer on Crypticity and Entropy Convergence
- Asymptotic Synchronization for Finite-State Sources
- The Elusive Present: Hidden Past and Future Dependency and Why We Build Models
- Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?
- Information Accessibility and Cryptic Processes: Linear Combinations of Causal States
Cited by in corpus (8)
- Thermodynamic uncertainty relation in slowly driven quantum heat engines
- Matrix Product States for Quantum Stochastic Modelling
- Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
- Local Causal States and Discrete Coherent Structures
- Spectral Simplicity of Apparent Complexity, Part II: Exact Complexities and Complexity Spectra
- Fraudulent White Noise: Flat power spectra belie arbitrarily complex processes
- Algebraic Theory of Patterns as Generalized Symmetries
- Engines for predictive work extraction from memoryful quantum stochastic processes