Comparing dynamical systems by a graph matching method
From MaRDI portal
Recommendations
- A dynamical systems approach to weighted graph matching
- Graph algorithms for dynamical systems
- On comparing dynamical systems by defective conjugacy: A symbolic dynamics interpretation of commuter functions
- A concept of homeomorphic defect for defining mostly conjugate dynamical systems
- Comparing Graphs via Persistence Distortion
Cites work
- A concept of homeomorphic defect for defining mostly conjugate dynamical systems
- An Introduction to Symbolic Dynamics and Coding
- Applied and computational measurable dynamics
- Chaos, fractals, and noise: Stochastic aspects of dynamics.
- Differential equations methods for the Monge-Kantorovich mass transfer problem
- How does a choice of Markov partition affect the resultant symbolic dynamics?
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 918596 (Why is no real title available?)
- scientific article; zbMATH DE number 3222869 (Why is no real title available?)
- Probability density functions of some skew tent maps
- Regularity of commuter functions for homeomorphic defect measure in dynamical systems model comparison
- The earth mover's distance as a metric for image retrieval
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
- Wasserstein distances in the analysis of time series and dynamical systems
Cited in
(5)- Matching of observations of dynamical systems, with applications to sequence matching
- A dynamical systems approach to weighted graph matching
- Optimal state amalgamation is NP-hard
- A concept of homeomorphic defect for defining mostly conjugate dynamical systems
- Testing topological conjugacy of time series
This page was built for publication: Comparing dynamical systems by a graph matching method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442483)
