Comparing dynamical systems by a graph matching method

DOI10.1016/j.physd.2013.03.012zbMath1284.37009OpenAlexW2125933118MaRDI QIDQ2442483

Joseph D. Skufca, Erik M. Bollt, Jiongxuan Zheng

Publication date: 3 April 2014

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physd.2013.03.012

zbMATH Keywords

symbolic dynamicsgraph matchingMonge-Kantorovich problemisomorphicEarth mover's distanceconjugate systems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Symbolic dynamics (37B10)

Related Items

Optimal state amalgamation is NP-hard

Uses Software

• EMD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wasserstein distances in the analysis of time series and dynamical systems
• Chaos, fractals, and noise: Stochastic aspects of dynamics.
• The earth mover's distance as a metric for image retrieval
• Applied and Computational Measurable Dynamics
• Differential equations methods for the Monge-Kantorovich mass transfer problem
• An Introduction to Symbolic Dynamics and Coding
• A concept of homeomorphic defect for defining mostly conjugate dynamical systems
• The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
• How does a choice of Markov partition affect the resultant symbolic dynamics?
• Probability density functions of some skew tent maps