Structure and Randomness of Continuous-Time Discrete-Event Processes
arXiv:1704.04707 · doi:10.1007/s10955-017-1859-y
Abstract
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomness; the statistical complexity gives the cost of predicting the process. We calculate, for the first time, the entropy rate and statistical complexity of stochastic processes generated by finite unifilar hidden semi-Markov models---memoryful, state-dependent versions of renewal processes. Calculating these quantities requires introducing novel mathematical objects (ε-machines of hidden semi-Markov processes) and new information-theoretic methods to stochastic processes.
arXiv comment10 pages, 2 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/ctdep.htm
References in corpus (8)
- Understanding individual human mobility patterns
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Inferring Markov Chains: Bayesian Estimation, Model Comparison, Entropy Rate, and Out-of-class Modeling
- Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics
- Information Content of Turbulence
- The application of computational mechanics to the analysis of geomagnetic data
- Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
- Characterization of intermittency in renewal processes: Application to earthquakes
Cited by in corpus (13)
- Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
- Characterising information-theoretic storage and transfer in continuous time processes
- Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
- Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
- Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators
- Local Causal States and Discrete Coherent Structures
- Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction
- Discovering Causal Structure with Reproducing-Kernel Hilbert Space -Machines
- Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics
- Embedding memory-efficient stochastic simulators as quantum trajectories
- Memory in quantum dot blinking
- Optimality and Complexity in Measured Quantum-State Stochastic Processes
- Intrinsic computation of a Monod-Wyman-Changeux molecule