Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective
Entropy · 16.07.2026 · 28 (7) · 812
DOI: 10.3390/e28070812 ↗Kurz gefasst
Fachartikel in der Zeitschrift Entropy, online erschienen am 16.07.2026. Verfasst von Boumediene Hamzi und 4 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA. Die Arbeit nennt 73 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Spurious correlations between time series are a persistent problem: simple, low-complexity patterns are abundant, so unrelated series can easily exhibit high Pearson correlation. We argue that Kolmogorov complexity—a series’ resistance to compression—provides a principled diagnostic for flagging such cases. We prove an algorithmic trilemma: a pair of binary sequences cannot simultaneously be algorithmically independent, highly correlated, and highly complex. This gives a deterministic complexity ceiling for independent correlated pairs and a probabilistic bound under which spurious correlations among independent high-complexity pairs are exponentially rare; we further bridge these results to an effective Hausdorff dimension obstruction. These guarantees hold for binary sequences under Hamming correlation; their extension to real-valued series via serialisation and LZ compression is empirically validated rather than proved, so the joint indicator JLZ=min{C˜LZ(x),C˜LZ(y)} is a calibrated diagnostic, not a causal test. On two toy models—coupled logistic maps and multivariate fractional Brownian motion (dimH=2−H)—false positives are far more common among low-complexity series. Because noise inflates complexity and non-stationary processes can be both complex and spuriously correlated, we recommend a two-stage workflow: establish stationarity, then report JLZ alongside ρ.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125, USA.
- The Alan Turing Institute, London NW1 2DB, UK.
- Institut Élie Cartan de Lorraine, French National Center for Scientific Research (CNRS), Université de Lorraine, 54506 Vandœuvre-lès-Nancy, France.
- Department of Mathematics and Natural Sciences, Center for Applied Mathematics and Bioinformatics, Gulf University for Science and Technology, Hawally 32093, Kuwait.
- School of Computing, Australian National University, Canberra, ACT 2601, Australia.
- Department of Computer Science, University of York, York YO10 5GH, UK.
ORCID-Profile: Kamal Dingle, Marcus Hutter, Mohammed Terry Jack
Zitieren
APA
Hamzi, B., Clausel, M., Dingle, K., Hutter, M., & Terry Jack, M. (2026). Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective. Entropy, 28(7), 812. https://doi.org/10.3390/e28070812
Vancouver
Hamzi B, Clausel M, Dingle K, Hutter M, Terry Jack M. Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective. Entropy. 2026;28(7):812. doi:10.3390/e28070812
BibTeX
@article{Hamzi2026,
author = {Hamzi, Boumediene and Clausel, Marianne and Dingle, Kamal and Hutter, Marcus and Terry Jack, Mohammed},
title = {Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective},
journal = {Entropy},
year = {2026},
volume = {28},
number = {7},
pages = {812},
doi = {10.3390/e28070812}
}
EUVIMED