Entropy-based Generating Markov Partitions for Complex Systems
Nicol\'as Rubido, Celso Grebogi, Murilo S. Baptista

TL;DR
This paper introduces a method to approximate Generating Markov Partitions for complex systems using finite data, enabling better symbolic encoding of trajectories and analysis of system complexity.
Contribution
It proposes a novel approach to construct GMPs from finite-resolution data in complex systems, facilitating invariant measure estimation and complexity analysis.
Findings
Method effectively encodes trajectories with minimal information loss.
Allows estimation of invariant probability measures from finite data.
Applicable to real-world data like EEG and climate measurements.
Abstract
Finding the correct encoding for a generic dynamical system's trajectory is a complicated task: the symbolic sequence needs to preserve the invariant properties from the system's trajectory. In theory, the solution to this problem is found when a Generating Markov Partition (GMP) is obtained, which is only defined once the unstable and stable manifolds are known with infinite precision and for all times. However, these manifolds usually form highly convoluted Euclidean sets, are \emph{a priori} unknown, and, as it happens in any real-world experiment, measurements are made with finite resolution and over a finite time-span. The task gets even more complicated if the system is a network composed of interacting dynamical units, namely, a high-dimensional complex system. Here, we tackle this task and solve it by defining a method to approximately construct GMPs for any complex system's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
