Correlation lengths in the language of computable information

Abstract

Computable Information Density (CID), the ratio of the length of a losslessly compressed data file to that of the uncompressed file, is a measure of order and correlation in both equilibrium and nonequilibrium systems. Here we show that correlation lengths can be obtained by decimation - thinning a configuration by sampling data at increasing intervals and recalculating the CID. When the sampling interval is larger than the system's correlation length, the data becomes incompressible. The correlation length and its critical exponents are thus accessible with no a-priori knowledge of an order parameter or even the nature of the ordering. The correlation length measured in this way agrees well with that computed from the decay of two-point correlation functions $g_2(r)$ when they exist. But the CID reveals the correlation length and its scaling even when $g_2(r)$ has no structure, as we demonstrate by "cloaking" the data with a Rudin-Shapiro sequence.

References in corpus (8)

• Nonequilibrium Critical Phenomena and Phase Transitions into Absorbing States
• Local Density Fluctuations, Hyperuniformity, and Order Metrics
• Hyperuniformity of critical absorbing states
• Quantifying hidden order out of equilibrium
• Order in glassy systems
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• Random Pinning Glass Model
• Approximating the Ising model on fractal lattices of dimension below two

Cited by in corpus (4)

• Play. Pause. Rewind. Measuring local entropy production and extractable work in active matter
• Vicsek Model by Time-Interlaced Compression: a Dynamical Computable Information Density
• When you can't count, sample! Computable entropies beyond equilibrium from basin volumes
• Patterns that persist: Heritable information in stochastic dynamics