Analysis of the phase transition in the Ising ferromagnet using a Lempel-Ziv string parsing scheme and black-box data-compression utilities
arXiv:1406.1354 · doi:10.1103/PhysRevE.91.023306
Abstract
In this work we consider information-theoretical observables to analyze short symbolic sequences, comprising time-series that represent the orientation of a single spin in a Ising ferromagnet on a square lattice of size , for different system temperatures . The latter were chosen from an interval enclosing the critical point of the model. At small temperatures the sequences are thus very regular, at high temperatures they are maximally random. In the vicinity of the critical point, nontrivial, long-range correlations appear. Here, we implement estimators for the entropy rate, excess entropy (i.e. "complexity") and multi-information. First, we implement a Lempel-Ziv string parsing scheme, providing seemingly elaborate entropy rate and multi-information estimates and an approximate estimator for the excess entropy. Furthermore, we apply easy-to-use black-box data compression utilities, providing approximate estimators only. For comparison and to yield results for benchmarking purposes we implement the information-theoretic observables also based on the well-established M-block Shannon entropy, which is more tedious to apply compared to the the first two "algorithmic" entropy estimation procedures. To test how well one can exploit the potential of such data compression techniques, we aim at detecting the critical point of the Ising ferromagnet. Among the above observables, the multi-information, which is known to exhibit an isolated peak at the critical point, is very easy to replicate by means of both efficient algorithmic entropy estimation procedures. Finally, we assess how good the various algorithmic entropy estimates compare to the more conventional block entropy estimates and illustrate a simple modification that yields enhanced results.
arXiv comment12 pages, 6 figures, 2 tables, supersedes arXiv:1206.7032
References in corpus (18)
- A Statistical Measure of Complexity
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Language Trees and Zipping
- Entropy estimation of symbol sequences
- The Organization of Intrinsic Computation: Complexity-Entropy Diagrams and the Diversity of Natural Information Processing
- Statistical Complexity of Simple 1D Spin Systems
- Structural Information in Two-Dimensional Patterns: Entropy Convergence and Excess Entropy
- A practical guide to computer simulations
- Mutual information in classical spin models
- Information theoretic aspects of the two-dimensional Ising model
- Comment on "Simple Measure of Complexity"
- Data compression and learning in time sequences analysis
- Response to Comments on "Simple Measure for Complexity"
- Extended Comment on Language Trees and Zipping
- Data Compression and Entropy Estimates by Non-sequential Recursive Pair Substitution
- Measuring complexity with zippers
- Information theoretic approach to ground-state phase transitions for two and three-dimensional frustrated spin systems
- Expressing the entropy of lattice systems as sums of conditional entropies
Cited by in corpus (12)
- Quantifying hidden order out of equilibrium
- Multi-scale structural complexity of natural patterns
- Universal and accessible entropy estimation using a compression algorithm
- Phenomenology of coupled non linear oscillators
- Complexity-entropy analysis at different levels of organization in written language
- Information density, structure and entropy in equilibrium and non-equilibrium systems
- Inferring entropy from structure
- Vicsek Model by Time-Interlaced Compression: a Dynamical Computable Information Density
- Computational capabilities at the edge of chaos for one dimensional system undergoing continuous transitions
- Resolving entropy contributions in nonequilibrium transitions
- Complexity and transition to chaos in coupled Adler-type oscillators
- Quantifying spatio-temporal patterns in classical and quantum systems out of equilibrium