betaFeedback

WorksPhysics and Astronomy

Revisiting entropy and entropy-related magnitudes of a symbolic sequence and their estimation

Abstract

This article revisits entropy and related magnitudes (entropy density, effective measure complexity, and informational distance) for the analysis of sequential data. We present their mathematical foundations within information theory and ergodic theory, establishing connections between probabilistic Shannon entropy and algorithmic Kolmogorov complexity. A central result, Zivs theorem, demonstrates the asymptotic equivalence between the normalised number of distinct words and entropy density, providing the theoretical basis for estimation via Lempel-Ziv factorisation. We examine the convergence properties of these magnitudes and introduce estimation procedures for finite sequences, including a method for the effective measure complexity and the transfer entropy rate. An open-source software library implementing parallel algorithms for efficient Lempel-Ziv factorisation is presented. The practical utility of the framework is illustrated through three case studies: functional brain connectivity analysis from fMRI data, characterisation of spatiotemporal dynamics in coupled nonlinear oscillators, and electrocardiogram-based classification of atrial fibrillation, demonstrating how entropic measures capture meaningful structural and dynamical properties across diverse domains.

Many complex systems are known to us through a single recorded signal, from which regularity, memory, and randomness must be disentangled. Entropy density, effective measure complexity, and informational distance measure exactly that – how unpredictable a signal is, how much memory it carries, how far two signals lie apart – yet their theory sits scattered across decades of literature, and their estimation is frequently done wrong. This article assembles that theory in one place, links Shannon’s entropy to Kolmogorov’s algorithmic complexity, and shows how Lempel-Ziv factorisation turns both into practical, parameter-free estimators, backed by open-source software that processes sequences of a billion symbols. Applied unchanged to fMRI recordings, a ring of coupled nonlinear oscillators, and electrocardiograms, the same measures recover task-related brain activity, detect collective behaviour near the onset of chaos, and separate healthy from arrhythmic heart rhythms with clinically relevant accuracy, showing that a single information-theoretic toolkit captures memory and unpredictability across strikingly different systems.

Introduction

Data from complex dynamical systems often appear as one or a few time series, from which the system’s dynamics must be extracted [65]. In data analysis, the usual aims are to assess regularity versus randomness, to identify patterns, to discover governing laws, or to predict future system behaviour [66]. One useful approach is to treat the dynamical system as an information source and apply information-theoretic tools alongside statistical descriptions [67]. In general, a single or just a few data sets are insufficient to fully understand the underlying dynamical system that drives the information source, yet these are often the only available data. In such cases, assuming ergodicity becomes necessary to extract the relevant information from the data [68].

For most systems, a fundamental quest is to find the relation between randomness and pattern in the system signal [69]. Randomness can be considered noise or, in a more useful perspective, the intrinsic uncertainty of the system, while a pattern is related to the deterministic laws that govern the system’s behaviour. It has been argued that for a complex dynamical system, the behaviour lies between complete predictability and total randomness [69]. Entropy density captures the irreducible unpredictability in a signal. Entropy density, also known as Kolmogorov-Sinai entropy, entropy rate, among other names, has been defined in several fields, including information theory, ergodic theory, and dynamical systems [67, 70]. A lesser-used measure of complexity is the effective measure of complexity, introduced by Grassberger [68], which aims to capture a system’s intrinsic memory and, in time-series analysis, its reliance on the past to define its future. Both magnitudes can be theoretically justified by Kolmogorov’s algorithmic complexity, which laid a solid foundation for the analysis of data beyond the ensemble-statistical point of view [71]. Kolmogorov’s theory of complexity builds on the existence of a universal computational machine, as demonstrated by Turing, and on the computational theory of recurrent functions [72]. From Kolmogorov theory, several concepts emerge that are closely related to entropy density and effective measure complexity; significantly, it also allows us to define the informational distance as a measure of the distance between two data sets [73].

The informational theory related concepts have been used extensively in analyzing experimental and theoretical models and there is an extensive literature regarding their use [70, 74, 75, 67, 76, 77, 78, 66]. In particular there is abundant literature dealing with the estimation of entropy density, and in a much lesser extent, effective measure complexity and informational distance [79, 80, 81, 82, 83, 84, 85, 86]. In spite of that, there persist some confusion in the validity of the estimation procedures, specially in the latter magnitudes, and its use, and the mathematics of the whole subject appears scattered in the scientific literature, some misconceptions also persist [84, 87].

This article revisits key concepts and their mathematical foundations, including estimation and practical use. It gathers work previously scattered across various sources, including new, unpublished results from the authors. The aim is to offer a comprehensive treatment, from theory to practice, in a single source. Publicly available software and a library for estimating these magnitudes are also introduced.

What this article is not, is a review, there are some important areas left out, specially the early work of Grassberger [68, 87] and the further studies by Crutchfield and Feldman [69] on entropy estimation for finite state automata, although some analytical results from their work will be used to compare estimated values of entropy density, and effective measure complexity with the exact values.

The article comprises three main parts: (1) mathematical foundations of information theory (§ 2, § 3, § 4, § 5); (2) analysis of Lempel-Ziv factorisation, complexity, and entropic magnitude estimation (§ 6, § 7, § 8); and (3) case studies (§ 9). Conclusions follow. The appendix contains additional material, including proofs and explanations of procedures. Table 1 collects the notation used throughout.

Strings, ergodicity and stationarity

The intuitive notion of a string corresponds to a sequence of successive symbols, which take values from a finite set, such as a binary alphabet. The index that traverses the positions of the symbols in a sequence is called time. Although in practice one must deal with finite strings, the concept extends to infinite strings, and this extension is used in proving certain theorems. However, it is worth clarifying that there are several types of infinite strings; the most general ones never begin or end (e.g., …1011010000111010100110011111110…\ldots 1011010000111010100110011111110\ldots), and are called bi-infinite. If a point is taken in a bi-infinite string, to the right there will be an infinite string that has a starting point but never ends (e.g., abbbaccbaab…abbbaccbaab\ldots); and to the left we will have one that ends but does not have a starting point (…32214441233\ldots32214441233). Any point in a bi-infinite string can be taken as the middle point.

Formally, a string is a successive concatenation of symbols u=…u−2u−1u0u1u2…ui…u=\ldots u_{-2}u_{-1} u_0 u_1u_2\ldots u_i\ldots emitted by a symbol source. uiu_i is known as a character and takes values from an alphabet A\mathcal{A}, ui∈A;∀i∈Zu_i\in\mathcal{A}; \forall i\in\mathbb{Z}. The index ii will be called time even though it does not represent that physical variable. The number of symbols available to the source will be taken as finite, ∣A∣<∞|\mathcal{A}|<\infty; the cardinality of the alphabet will be denoted by α(=∣A∣)\alpha(=|\mathcal{A}|). Throughout, string positions are indexed from zero; u(ℓ)=u0u1…uℓ−1u^{(\ell)}=u_0u_1\ldots u_{\ell-1} denotes the prefix of length ℓ\ell. Unless otherwise stated, log⁡≡log⁡α\log\equiv\log_\alpha; if the sequence is binary, then α=2\alpha=2 and entropies are expressed in bits.

When a string is finite, we call it a word. A word ww has length ∣w∣|w|. It is important to include the null sequence Λ\Lambda, which has length (∣Λ∣=)0(|\Lambda|=)0. If we have two strings ww and uu, the sequence wuwu is the concatenation of both sequences in the indicated order, and its length would be ∣w∣+∣u∣|w|+|u|.

It is convenient to consider a symbol source or emitter as generating discrete strings uninterruptedly; its output is bi-infinite strings. To circumvent the problems associated with time in generating bi-infinite strings when considering the occurrence of multiple strings, we can imagine that instead of a single emitter, we have a set, called an ensemble, of countably infinite identical emitters, each generating a bi-infinite string. Since, from a practical point of view, it is useful to consider finite strings, they are taken as the result of observing an emitter’s output over a finite time interval (…1001000001100011111110010000111…\ldots100100000\boxed{11000111111}10010000111\ldots). For a source, the set of rules it follows as they generate the bi-infinite string is called a grammar and denoted by GG (e.g., a binary source that only emits an even number of 0s).

The set of all strings of finite length (words) will be denoted by A∗\mathcal{A}^* and those of infinite length by A∞\mathcal{A}^\infty.

Consider an infinite string u∈A∞u\in\mathcal{A}^{\infty}. If we define the set of all finite substrings of uu, it is possible to define a σ\sigma-algebra on that set and assign a probability measure to the set.

For example, take the set of all strings of finite length. Consider the initial collection formed by subsets of strings, where each subset contains strings of the same length. From this initial collection, a σ\sigma-algebra can be generated, and probabilities can be assigned to the strings based on their length. A similar probability assignment can be done to other partitions of the strings into classes.

A subsequence or substring wab⊆uw_a^b\subseteq u is a sequence of symbols extracted from uu starting at time aa, up to time bb, and, therefore, of length b−a+1b-a+1. The word ww, where the position in the uu string is irrelevant, is called the base word. A subsequence can be infinite or can be a word.

It is useful to introduce the drop operator π\pi, such that when operating on the left on a word, it removes the first character of the string, πwab≡wa+1b\pi w_a^b\equiv w_{a+1}^b (e.g., π101100=01100\pi 101100=01100); and operating on the right removes the last character of the string, wabπ≡wab−1w_a^b \pi\equiv w_a^{b-1} (e.g., 101100π=10110101100\pi=10110).

A sequence can be shifted to the right such that if we call Θ[u]\Theta[u] the shifted string, we will have [Θ(u)]t=ut−1[\Theta(u)]_t = u_{t-1} (Θ[…u51001u10…]=…u4u51001…\Theta[\dots u_5 1 0 0 1 u_{10} \ldots] = \dots u_4 u_5 1 0 0 1 \ldots). We define the same for a left shift (Θ−1[u]\Theta^{-1}[u]) where we will have [Θ−1(u)]t=ut+1[\Theta^{-1}(u)]_t = u_{t+1} (Θ−1[…u51001u10…]=…1001u10u11…\Theta^{-1}[\dots u_5 1 0 0 1 u_{10} \ldots] = \dots 1 0 0 1 u_{10} u_{11} \ldots). The operator Θ\Theta is called the right shift operator, and Θ−1\Theta^{-1} is called the left shift operator.

The two most important properties required of a source are ergodicity and stationarity.

Ergodicity means that the strings emitted by the source are statistically indistinguishable: for almost every string u∈A∞u\in\mathcal{A}^\infty emitted by an ergodic source ψ\psi, the relative frequency with which any finite word ww occurs along uu converges to the same value P(w)P(w), whatever the string (e.g., Pu(w)=Pv(w)P_u(w)=P_v(w) for two emitted strings uu and vv). A single string then characterises the source, and ensemble averages can be replaced by averages along one realisation.

Stationarity refers to the temporal invariance of the emitter’s statistical properties. In other words, the probability of a specific finite string, of any length, occurring in a bi-infinite string does not depend on the instant in time at which the finite string occurs.

Stationarity implies that the probability of occurrence of a substring in an infinite string emitted by the source depends only on the base word of the substring and not on the starting time. A stationary source implies that for all u∈A∞u\in\mathcal{A}^\infty, P(u)=P(Θ(u))P(u)=P(\Theta(u)).

If a process is stationary, all instances wijw_i^j of the base word ww have the same probability (P(wab)=P(w)P(w_a^b)=P(w)) for any string u∈A∞u\in\mathcal{A}^\infty.

Alphabet, strings and wordsAlgorithmic complexity and distance
A, α\mathcal{A},\ \alphaAlphabet and its size,α=∣A∣\alpha=|\mathcal{A}|U\mathcal{U}Universal Turing machine
A∗, A∞\mathcal{A}^{*},\ \mathcal{A}^{\infty}Words; infinite stringsK(w), w∗K(w),\ w^{*}Kolmogorov complexity; minimal program
ψ, G\psi,\ GSymbol source; its grammarK(w1∣w2), K(w1:w2)K(w_1|w_2),\ K(w_1{:}w_2)Conditional complexity; algorithmic mutual information
u, vu,\ vBi-infinite string emitted byψ\psikℓ, k(u)k_\ell,\ k(u)Complexity per symbol,K(u(ℓ))/ℓK(u^{(\ell)})/\ell
uiu_iCharacter at timeii,ui∈Au_i\in\mathcal{A}ηℓ\eta_\ellAny ofζℓ,hℓ,ΔHℓ,kℓ\zeta_\ell,h_\ell,\Delta H_\ell,k_\ell
u(ℓ)u^{(\ell)}Prefixu0…uℓ−1u_0\ldots u_{\ell-1}, of lengthℓ\ellδhℓ(η), Eη\delta h^{(\eta)}_\ell,\ E_\etaDeficit∣ηℓ−h∣|\eta_\ell-h|; its sum overℓ\ell
w, ∣w∣w,\ |w|Word (finite string) and its lengthν, β\nu,\ \betaDecay exponents ofδhℓ(η)\delta h^{(\eta)}_\ell
wabw^{b}_{a}Substring ofuufrom timeaatobbd∥, dd_{\parallel},\ dAbsolute and normalised information distance
Λ\LambdaNull string,∣Λ∣=0|\Lambda|=0ΔK, Δh\Delta K,\ \Delta hNet flow of information
u−, u+u^{-},\ u^{+}Past and future halves ofuu;uℓ∓u^{\mp}_\elltheℓ\ellsymbols nearest the cutTE, TERTE,\ TERTransfer entropy and its per-symbol rate
N, ℓN,\ \ellSequence length; block lengthm, Mm,\ MEmbedding order; state-vector dimension,M=2m+1M=2m+1
ppPeriod of a periodic sequence
Operators and probabilityLempel--Ziv factorisation and estimation
π\piDrop operator,πwab=wa+1b\pi w^{b}_{a}=w^{b}_{a+1},wabπ=wab−1w^{b}_{a}\pi=w^{b-1}_{a}V(w)\mathcal{V}(w)Vocabulary: all distinct words ofww
Θ, Θ−1\Theta,\ \Theta^{-1}Right and left shift operatorsFi, aiF_i,\ a_iii-th factor; position where it begins
P[⋅]P[\cdot]Probability of a stringLZ(w), CLZLZ(w),\ C_{LZ}Exhaustive factorisation; its number of factors
E[⋅]\mathbb{E}[\cdot]Expected value over the sourcecLZ(N)c_{LZ}(N)Normalised complexity,CLZ/(N/log⁡N)C_{LZ}/(N/\log N)
N(μ,σ2)\mathcal{N}(\mu,\sigma^2)Normal distributionnFn_FNumber of factors of a factorisation
Ω\OmegaTypical set of the AEPλk, μ, σ\lambda_k,\ \mu,\ \sigmaFactor length; its mean and standard deviation
ϵ\epsilonArbitrarily small positive quantityZZVariate drawn fromN(0,1)\mathcal{N}(0,1)
log⁡\log≡log⁡α\equiv\log_\alphaunless otherwise statedϵN, κ\epsilon_N,\ \kappaFinite-size correction; offset of theCLZC_{LZ}ansatz
Entropiesn, Neffn,\ N_{\mathrm{eff}}Truncation limit ofE^(n)\widehat E(n); effective lengthNhNh
HℓH_\ellShannon block entropy of the length-ℓ\ellwordsmℓ, ni, f1,ℓm_\ell,\ n_i,\ f_{1,\ell}Windows sampled; block counts; blocks seen once
ΔHℓ\Delta H_\ellEntropy gain,Hℓ−Hℓ−1H_\ell-H_{\ell-1}C^ℓ, p^i, H^ℓCS\widehat C_\ell,\ \widehat p_i,\ \widehat H^{CS}_\ellCoverage; adjusted probability; Chao--Shen entropy
hhEntropy density (Kolmogorov--Sinai entropy)Γ\GammaNumber of surrogates
hℓh_\ellFinite entropy rate of orderℓ\ell,Hℓ/ℓH_\ell/\ellvt, zt, α~v_t,\ z_t,\ \tilde\alphaState vector; its encoding; extended alphabet sizeαM\alpha^{M}
#ℓ\#_\ellNumber of distinct words of lengthℓ\ellModel sources and case studies
ζℓ\zeta_\ellDefined by#ℓ=α ℓζℓ\#_\ell=\alpha^{\,\ell\zeta_\ell}Si, TiaS_i,\ \mathcal{T}^{a}_{i}FSA state; its transition probability
I[⋅,⋅]I[\cdot,\cdot]Mutual informationpi(t), pi(∞)p^{(t)}_i,\ p^{(\infty)}_iProbability of stateSiS_iat steptt; asymptotic value
EEEffective measure complexity,E=I[u−,u+]E=I[u^{-},u^{+}]τ, τˉ\tau,\ \bar\tauTransition probability of the even and 2ssp processes
ℓc\ell_cLength beyond whichΔHℓ\Delta H_\ellhas converged tohhp, pˉp,\ \bar pSymbol probability of the RRXOR process
θi, ω, γ\theta_i,\ \omega,\ \gammaOscillator phase, natural frequency, coupling
rij, ⊕r_{ij},\ \oplusRecurrence-matrix entry; exclusive-or

Table 1. Notation used throughout. A hat denotes a magnitude estimated from a finite sequence.

References

  1. [65]\BibitemOpen H. Kantz\ and\ T. Schreiber,\ Nonlinear Time Series Analysis \ (Cambridege University Press,\ 1997) NoStop
  2. [66]\BibitemOpen J. P.\ Crutchfield,\ Nature\ 8,\ 17 (2012) NoStop
  3. [67]\BibitemOpen T. M.\ Cover\ and\ J. A.\ Thomas,\ Elements of Information Theory ,\ 2nd\ ed.\ (Wiley-Interscience,\ 2006) NoStop
  4. [68]\BibitemOpen P. Grassberger,\ Int. J. Theor. Phys.\ 25,\ 907 (1986) NoStop
  5. [69]\BibitemOpen J. P.\ Crutchfield\ and\ D. P.\ Feldman,\ Chaos: An Interdisciplinary Journal of Nonlinear Science\ 13,\ 25 (2003) NoStop
  6. [70]\BibitemOpen R. Badii\ and\ A. Politi,\ Complexity: Hierarchical Structures and Scaling in Physics. \ (Cambridge University Press,\ 1999) NoStop
  7. [71]\BibitemOpen A. N.\ Kolmogorov,\ Probl. Inf. Transm. (English Trans.).\ 1,\ 1 (1965) NoStop
  8. [72]\BibitemOpen M. Li\ and\ P. Vitányi,\ An Introduction to Kolmogorov Complexity and Its Applications. \ (Springer Verlag,\ 1993) NoStop
  9. [73]\BibitemOpen M. Li, X. Chen, X. Li, B. Ma,\ and\ P. Vitanyi,\ https://doi.org/10.1109/TIT.2004.838101 IEEE Trans. Inform. Theory\ 50,\ 3250 (2004) NoStop
  10. [74]\BibitemOpen V. D.Gusev, L. A.Nemytikova,\ and\ N. A.Chuzhanova,\ https://doi.org/10.1093/bioinformatics/15.12.994 Bioinformatics\ 15,\ 994 (1999) NoStop
  11. [75]\BibitemOpen M. Ferrario, M. Signorini,\ and\ S. Cerutti,\ in\ https://doi.org/10.1109/IEMBS.2004.1404105 The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society ,\ Vol. 4\ (IEEE,\ 2004)\ pp.\ 3956--3959 NoStop
  12. [76]\BibitemOpen D. Abasolo, C. J.\ James,\ and\ R. Hornero,\ in\ https://doi.org/10.1109/IEMBS.2007.4352700 2007 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society \ (IEEE,\ 2007)\ pp.\ 1953--1956 NoStop
  13. [77]\BibitemOpen D. P.\ Feldman, C. S.\ McTeque,\ and\ J. P.\ Crutchfield,\ Chaos\ 18,\ 043106 (2008) NoStop
  14. [78]\BibitemOpen A. Chelani,\ https://doi.org/10.1016/j.trd.2010.08.008 Transportation Research Part D: Transport and Environment\ 16,\ 57 (2011) NoStop
  15. [79]\BibitemOpen F. Kaspar\ and\ H. G.\ Schuster,\ Phys. Rev. A\ 36,\ 842 (1987) NoStop
  16. [80]\BibitemOpen E. N.\ Gilbert\ and\ T. T.\ Kadota,\ IEEE Trans. Inform. Theory\ 38 (1992) NoStop
  17. [81]\BibitemOpen A. Baruch\ and\ N. Merhav,\ in\ https://doi.org/10.1109/ISIT.2000.866389 2000 IEEE International Symposium on Information Theory ( Cat . No . 00CH37060 ) \ (IEEE,\ 2000)\ p. 99 NoStop
  18. [82]\BibitemOpen M. Alfonseca, M. Cebrián,\ and\ A. Ortega,\ https://doi.org/10.4310/CIS.2005.v5.n4.a1 Communications in Information and Systems\ 5,\ 367 (2005) NoStop
  19. [83]\BibitemOpen M. Cebrin, M. Alfonseca,\ and\ A. Ortega,\ https://doi.org/10.1109/TIT.2007.894669 IEEE Trans. Inform. Theory\ 53,\ 1895 (2007) NoStop
  20. [84]\BibitemOpen A. Lesne, J.L.Blanc,\ and\ L. Pezard,\ Phys. Rev. E\ 79,\ 046208 (2009) NoStop
  21. [85]\BibitemOpen O. Melchert\ and\ A. K.\ Hartmann,\ https://doi.org/10.1103/PhysRevE.91.023306 Phys. Rev. E\ 91,\ 023306 (2015) NoStop
  22. [86]\BibitemOpen R. Avinery, M. Kornreich,\ and\ R. Beck,\ https://doi.org/10.1103/PhysRevLett.123.178102 Phys. Rev. Lett.\ 123,\ 178102 (2019) ,\ https://arxiv.org/abs/1709.10164 1709.10164 NoStop
  23. [87]\BibitemOpen P. Grassberger,\ arXiv\ (2018) ,\ https://arxiv.org/abs/1708.03197 arXiv:1708.03197 [physics:physics] NoStop
  24. [88]\BibitemOpen C. Shannon,\ Bell Syst. Tech. J.\ 30,\ 379 (1951 a ) NoStop
  25. [89]\BibitemOpen C. Shannon,\ Bell Syst. Tech. J.\ 30,\ 50 (1951 b ) NoStop
  26. [90]\BibitemOpen J. Ziv,\ IEEE Trans. Inf. Th.\ IT-24,\ 405 (1978) NoStop
  27. [91]\BibitemOpen H. Zurek,\ Phys. Rev. A\ 40,\ 4731 (1989 a ) NoStop
  28. [92]\BibitemOpen C. H.\ Bennet, P. Gacs, M. Li, P. M. B.\ Vitanyi,\ and\ H. Zurek,\ IEEE Trans. Inform. Theory\ 341,\ 119 (1998) NoStop
  29. [93]\BibitemOpen H. Zurek,\ Nature\ 44,\ 1407 (1989 b ) NoStop
  30. [94]\BibitemOpen R. Landauer,\ IBM J. Res. Dev.\ 3,\ 183 (1961) NoStop
  31. [95]\BibitemOpen J. Lin,\ https://doi.org/10.1109/18.61115 IEEE Trans. Inf. Theory\ 37,\ 145 (1991) NoStop
  32. [96]\BibitemOpen D. M.\ Endres\ and\ J. E.\ Schindelin,\ https://doi.org/10.1109/TIT.2003.813506 IEEE Trans. Inf. Theory\ 49,\ 1858 (2003) NoStop
  33. [97]\BibitemOpen T. Schreiber,\ Phys. Rev. Lett.\ 85,\ 461 (2000) NoStop
  34. [98]\BibitemOpen J. F.\ Restrepo, D. M.\ Mateos,\ and\ G. Schlotthauser,\ Physical Review E\ 101,\ 052117 (2020) NoStop
  35. [99]\BibitemOpen A. Lempel\ and\ J. Ziv,\ https://doi.org/10.1109/TIT.1976.1055501 IEEE Trans. Inform. Theory\ 22,\ 75 (1976) NoStop
  36. [100]\BibitemOpen J. M.\ Amigó\ and\ M. B.\ Kennel,\ https://doi.org/10.1063/1.2347102 Chaos: An Interdisciplinary Journal of Nonlinear Science\ 16,\ 043102 (2006) NoStop
  37. [101]\BibitemOpen A. Chao\ and\ T.-J.\ Shen,\ https://doi.org/10.1023/A:1026096204727 Environmental and Ecological Statistics\ 10,\ 429 (2003) NoStop
  38. [102]\BibitemOpen S. Zozor, P. Ravier,\ and\ O. Buttelli,\ Physica A: Statistical Mechanics and its Applications\ 345,\ 285 (2005) NoStop
  39. [103]\BibitemOpen E. Aragón-Pérez, A. Mesa-Rodríguez, K. García-Medina, D. Estevez-Moya, A. Mollineda-Rodríguez,\ and\ E. Estevez-Rams,\ https://doi.org/10.5281/zenodo.23531093 lzcomplexity: Parallel L empel- Z iv factorisation and entropic magnitudes ,\ https://github.com/pleros-ai/lzcomplexity (2026),\ open-source C++/Python library, Zenodo, https://doi.org/10.5281/zenodo.23531093 NoStop
  40. [104]\BibitemOpen I. Corporation,\ https://www.intel.com/content/www/us/en/develop/documentation/ onetbb-documentation/top.html. Intel( R ) oneAPI Threading Building Blocks ( oneTBB ) Documentation . (2023) NoStop
  41. [105]\BibitemOpen M. Crochemore, L. Ilie,\ and\ W. F.\ Smyth,\ in\ https://doi.org/10.1109/DCC.2008.36 Data Compression Conference (Dcc 2008) \ (IEEE,\ 2008)\ pp.\ 482--488 NoStop
  42. [106]\BibitemOpen M. Crochemore\ and\ L. Ilie,\ https://doi.org/10.1016/j.ipl.2007.10.006 Information Processing Letters\ 106,\ 75 (2008) NoStop
  43. [107]\BibitemOpen M. F.\ Glasser, S. N.\ Sotiropoulos, J. A.\ Wilson, T. S.\ Coalson, B. Fischl, J. L.\ Andersson, J. Xu, S. Jbabdi, M. Webster, J. R.\ Polimeni, D. C.\ Van Essen,\ and\ M. Jenkinson,\ https://doi.org/10.1016/j.neuroimage.2013.04.127 NeuroImage\ 80,\ 105 (2013) NoStop
  44. [108]\BibitemOpen T. Ito, S. L.\ Brincat, M. Siegel, R. D.\ Mill, B. J.\ He, E. K.\ Miller, H. G.\ Rotstein,\ and\ M. W.\ Cole,\ https://doi.org/10.1371/journal.pcbi.1007983 PLOS Computational Biology\ 16,\ e1007983 (2020) NoStop
  45. [109]\BibitemOpen A. Mesa-Rodr í guez, E. Estevez-Rams,\ and\ H. Kantz,\ arXiv preprint arXiv:2507.04442\ (2025) NoStoparxiv.org/abs/2507.04442
  46. [110]\BibitemOpen A. T.\ Winfree,\ J. Theor. Biol.\ 16,\ 15 (1967) NoStop
  47. [111]\BibitemOpen R. Adler,\ Proc. of the IEEE\ 61,\ 1380 (1973) NoStop
  48. [112]\BibitemOpen Y. K.\ Kuramoto,\ in\ International Symposiumon Mathematical Problems in Theoretical Physics, Lectures Notes in Physics No. 30 ,\ edited by\ H. Araki\ (Springer, New York,\ 1975)\ pp.\ 420--422 NoStop
  49. [113]\BibitemOpen J. .\ Acebrón, L. L.\ Bonilla, C. J. P.\ Vicente, F. Ritort,\ and\ R. Spigler,\ Rev. Mod. Phys.\ 77,\ 137 (2005) NoStop
  50. [114]\BibitemOpen L. M.\ Alonso,\ Chaos: An Interdisciplinary Journal of Nonlinear Science\ 27 (2017) NoStop
  51. [115]\BibitemOpen E. Estevez-Rams, D. Estevez-Moya,\ and\ B. Aragon-Fernandez,\ Chaos\ 28,\ 23110 (2018) NoStop
  52. [116]\BibitemOpen E. Estevez-Rams, D. Estevez-Moya,\ and\ K. Garcia-Medina,\ Chaos\ 29,\ 043105 (2019 a ) NoStop
  53. [117]\BibitemOpen D. Estevez-Moya, E. Estevez-Rams,\ and\ H. Kantz,\ Physical Review E\ 107,\ 004212 (2023) NoStop
  54. [118]\BibitemOpen E. Estevez-Rams, K. Garcia-Medina,\ and\ B. Aragon-Fernandez,\ Comm. in Non. Lin. Sci. and Num. Sim.\ 133,\ 107989 (2024) NoStop
  55. [119]\BibitemOpen N. H.Packard,\ in\ Dynamic patterns in complex systems ,\ edited by\ J. A. S.\ Kelso, A. J.\ Mandell,\ and\ M. F.\ Shlesinger\ (World Scientific, Singapore,\ 1988)\ pp.\ 293--301 NoStop
  56. [120]\BibitemOpen C. G.Langton,\ Physica D\ 42,\ 12 (1990) NoStop
  57. [121]\BibitemOpen S. A.\ Kauffman\ and\ S. Johnson,\ in\ Artificial Life II ,\ edited by\ C. Langton, G. Taylor, J. D.\ Farmer,\ and\ S. Rasmussen\ (Addison Wesley, Redwood City,\ 1992)\ pp.\ 325--368 NoStop
  58. [122]\BibitemOpen N. Bertschinger\ and\ T. Natschlager,\ Neural computation\ 16,\ 1413 (2004) NoStop
  59. [123]\BibitemOpen E. Estevez-Rams, A. Mesa-Rodriguez,\ and\ D. Estevez-Moya,\ PloS one\ 14,\ e0214863 (2019 b ) NoStop
  60. [124]\BibitemOpen A. Mesa-Rodr í guez, A. Gonzalez, E. Estevez-Rams,\ and\ P. A.\ Valdes-Sosa,\ Entropy\ 24,\ 1744 (2022) NoStop
  61. [125]\BibitemOpen R. Pe ñ a-Mendieta, A. Mesa-Rodr í guez, D. Estevez-Moya, J. R.\ de La Horra, E. Estevez-Rams,\ and\ H. Kantz,\ Plos one\ 20,\ e0334694 (2025) NoStop
  62. [126]\BibitemOpen M. Fekete,\ https://doi.org/10.1007/BF01504345 Math. Z.\ 17,\ 228 (1923) NoStop
  63. [127]\BibitemOpen M. Ayer, H. D.\ Brunk, G. M.\ Ewing, W. T.\ Reid,\ and\ E. Silverman,\ https://doi.org/10.1214/aoms/1177728423 The Annals of Mathematical Statistics\ 26,\ 641 (1955) NoStop
  64. [128]\BibitemOpen D. Zambella\ and\ P. Grassberger,\ Complex Systems\ 2,\ 269 (1988) NoStop

Paper details

vlnc:W_mz4c82b6
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents