Complexity through nonextensivity
From MaRDI portal
Publication:5951423
DOI10.1016/S0378-4371(01)00444-7zbMath0979.37042arXivphysics/0103076OpenAlexW3102564925WikidataQ60453020 ScholiaQ60453020MaRDI QIDQ5951423
William Bialek, Ilya Nemenman, Naftali Tishby
Publication date: 6 January 2002
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/physics/0103076
Time-dependent statistical mechanics (dynamic and nonequilibrium) (82C99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Time series analysis of dynamical systems (37M10) Measures of information, entropy (94A17)
Related Items (9)
Co-evolutionary mechanisms of emotional bursts in online social dynamics and networks ⋮ Optimal guessing under nonextensive framework and associated moment bounds ⋮ Predictive information in a nonequilibrium critical model ⋮ On hidden Markov processes with infinite excess entropy ⋮ Transition matrix analysis of earthquake magnitude sequences ⋮ Entropy embedding and fluctuation analysis in genomic manifolds ⋮ Excess entropy in natural language: Present state and perspectives ⋮ Natural complexity, computational complexity and depth ⋮ Local entropy and structure in a two-dimensional frustrated system
Cites Work
- A Mathematical Theory of Communication
- Toward a quantitative theory of self-generated complexity
- Predictability, Complexity, and Learning
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- Prediction and Entropy of Printed English
- Field Theories for Learning Probability Distributions
- Entropy estimation of symbol sequences
- Fisher information and stochastic complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity through nonextensivity