Pith. sign in

REVIEW 2 cited by

Reduced Markovian Models of Dynamical Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.10864 v2 pith:MPPK7R7H submitted 2023-08-21 nlin.CD

classification nlin.CD
keywords dynamicalsystemsstatisticaldynamicsmarkovmethodologyproblemprocess
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Leveraging recent work on data-driven methods for constructing a finite state space Markov process from dynamical systems, we address two problems for obtaining further reduced statistical representations. The first problem is to extract the most salient reduced-order dynamics for a given timescale by using a modified clustering algorithm from network theory. The second problem is to provide an alternative construction for the infinitesimal generator of a Markov process that respects statistical features over a large range of timescales. We demonstrate the methodology on three low-dimensional dynamical systems with stochastic and chaotic dynamics. We then apply the method to two high-dimensional dynamical systems, the Kuramoto-Sivashinky equations and data sampled from fluid-flow experiments via Particle-Image Velocimetry. We show that the methodology presented herein provides a robust reduced-order statistical representation of the underlying system.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Modified Bisecting K-Means for Approximating Transfer Operators: Application to the Lorenz Equations

    physics.comp-ph 2024-12 conditional novelty 5.0 of 10

    A bisecting k-means partition with up to about one million cells yields transfer-operator approximations for the Lorenz system that converge for invariant statistics and autocorrelations, while the quasi-invariant Koo...

  2. Learning dissipation and instability fields from chaotic dynamics

    nlin.CD 2025-02 conditional novelty 4.0 of 10

    Row sums of an estimated transition matrix give local inverse dissipation; column maxima give an upper bound on the inverse Jacobian, tested on 1D and 2D chaotic maps.

Pith tools