Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles

DOI10.1137/S106482750238911XzbMath1042.37063WikidataQ59139594 ScholiaQ59139594MaRDI QIDQ4442139

Gary Froyland, Michael Dellnitz

Publication date: 20 January 2004

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

graph partitioningLaplacian matrixFiedler vectoralmost-invariant setminimal cutmaximal cutmacrostructurealmost cycle

Mathematics Subject Classification ID

Smooth ergodic theory, invariant measures for smooth dynamical systems (37C40) Connectivity (05C40) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Software, source code, etc. for problems pertaining to dynamical systems and ergodic theory (37-04)

Related Items (39)

Almost-invariant sets and invariant manifolds - connecting probabilistic and geometric descriptions of coherent structures in flows ⋮ Mesochronic classification of trajectories in incompressible 3D vector fields over finite times ⋮ Near invariance and local transience for random diffeomorphisms ⋮ On the computation of attractors for delay differential equations ⋮ Modern Koopman Theory for Dynamical Systems ⋮ TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS ⋮ Sparsity enabled cluster reduced-order models for control ⋮ Using heteroclinic orbits to quantify topological entropy in fluid flows ⋮ On fast computation of finite-time coherent sets using radial basis functions ⋮ A geometric heat-flow theory of Lagrangian coherent structures ⋮ A coherent structure approach for parameter estimation in Lagrangian data assimilation ⋮ A Set-Oriented Numerical Approach for Dynamical Systems with Parameter Uncertainty ⋮ A patch in time saves nine: methods for the identification of localised dynamical behaviour and lifespans of coherent structures ⋮ Heterogeneity of the attractor of the Lorenz '96 model: Lyapunov analysis, unstable periodic orbits, and shadowing properties ⋮ Computing covariant Lyapunov vectors, Oseledets vectors, and dichotomy projectors: A comparative numerical study ⋮ An analytic framework for identifying finite-time coherent sets in time-dependent dynamical systems ⋮ Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification ⋮ Geometry of the ergodic quotient reveals coherent structures in flows ⋮ Characterizing Flows by Complex Network Methods ⋮ The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems ⋮ Optimal transport over nonlinear systems via infinitesimal generators on graphs ⋮ Understanding the geometry of transport: Diffusion maps for Lagrangian trajectory data unravel coherent sets ⋮ Computing coherent sets using the Fokker-Planck equation ⋮ Improving spectral bounds for clustering problems by Lagrangian relaxation ⋮ Finite-time entropy: a probabilistic approach for measuring nonlinear stretching ⋮ Absolute flux optimising curves of flows on a surface ⋮ Statistically optimal almost-invariant sets ⋮ Identifying almost invariant sets in stochastic dynamical systems ⋮ Robust Perron cluster analysis in conformation dynamics ⋮ Local expansion concepts for detecting transport barriers in dynamical systems ⋮ Coherent sets for nonautonomous dynamical systems ⋮ Robust FEM-Based Extraction of Finite-Time Coherent Sets Using Scattered, Sparse, and Incomplete Trajectories ⋮ Towards hybrid system modeling of uncertain complex dynamical systems ⋮ A Set-Oriented Path Following Method for the Approximation of Parameter Dependent Attractors ⋮ The Numerical Computation of Unstable Manifolds for Infinite Dimensional Dynamical Systems by Embedding Techniques ⋮ On the Approximation of Transport Phenomena - a Dynamical Systems Approach ⋮ Data-driven spectral decomposition and forecasting of ergodic dynamical systems ⋮ Transport in time-dependent dynamical systems: Finite-time coherent sets ⋮ Partitions of networks that are robust to vertex permutation dynamics

This page was built for publication: Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles