A computational framework for connection matrix theory

DOI10.1007/S41468-021-00073-3MaRDI QIDQ2239809zbMATH OpenOpenAlexFDO

Authors Shaun Harker, Kelly Spendlove, K. Mischaikow

Publication date 5 November 2021

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.04552

zbMATH Keywords

computational dynamicscomputational topologyConley indexconnection matrixdiscrete Morse theorypersistent homology

Mathematics Subject Classification ID

Stability of topological dynamical systems (37B25) Index theory for dynamical systems, Morse-Conley indices (37B30) Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)

Abstract: The connection matrix is a powerful algebraic topological tool from Conley index theory that captures relationships between isolated invariant sets. Conley index theory is a topological generalization of Morse theory in which the connection matrix subsumes the role of the Morse boundary operator. Over the last few decades, the ideas of Conley have been cast into a purely computational form. In this paper we introduce a computational, categorical framework for the connection matrix theory. This contribution transforms the computational Conley theory into a computational homological theory for dynamical systems. More specifically, within this paper we have two goals: 1) We cast the connection matrix theory into appropriate categorical, homotopy-theoretic language. We identify objects of the appropriate categories which correspond to connection matrices and may be computed within the computational Conley theory paradigm by using the technique of reductions. 2) We describe an algorithm for this computation based on algebraic-discrete Morse theory.

Review text

An important task in topological data analysis is the construction of a filtered simplicial complex \(X\) and its associated chain complex \(C(X)\) from the data, and the computation of its homology. Typically these complexes are huge and costly to handle. In the present paper the authors introduce an algorithm to transform a graded chain complex so that the transformed complex, called Conley complex, has a simple boundary operator, called connection matrix. This is done in a categorical context: the original complex and the transformed one are equivalent in a certain homotopy category of graded chain complexes. The authors relate their approach to the original definitions of connection matrices in the context of Conley index theory due to \textit{R. D. Franzosa} [Trans. Am. Math. Soc. 311, No. 2, 561--592 (1989; Zbl 0689.58030)] and \textit{J. W. Robbin} and \textit{D. A. Salamon} [Ergodic Theory Dyn. Syst. 12, No. 1, 153--183 (1992; Zbl 0737.58033)]. The paper also contains a pseudo-code for the computation of connection matrices, and a reference to the implementation of the algorithm by the first and third authors. Moreover the authors show that the Conley complex and its connection matrix can be used to compute the persistent homology of a filtered chain complex.

Recommendations

• scientific article; zbMATH DE number 4069362
• The Connection Matrix Theory for Morse Decompositions
• conley: Computing connection matrices in Maple
• COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
• Spectral sequences and detailed connection matrices

Cites work

• A Fixed Point Approach to Homological Perturbation Theory
• Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
• Algebraic Morse theory and homological perturbation theory
• Algebraic transition matrices in the Conley index theory
• Allowing cycles in discrete Morse theory
• An algorithmic approach to chain recurrence
• An algorithmic approach to lattices and order in dynamics
• Categorification of persistent homology
• Combinatorial algebraic topology
• COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
• Computational topology. An introduction
• Computing multidimensional persistence
• Computing multiparameter persistent homology through a discrete Morse-based approach
• Connected Simple Systems and The Conley Index of Isolated Invariant Sets
• Connecting orbits in one-parameter families of flows
• Differentiable dynamical systems
• Discrete Morse theoretic algorithms for computing homology of complexes and maps
• Dynamical systems, shape theory and the Conley index
• Global Asymptotic Dynamics of Gradient-Like Bistable Equations
• scientific article; zbMATH DE number 5367214 (Why is no real title available?)
• scientific article; zbMATH DE number 3616736 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 841435 (Why is no real title available?)
• scientific article; zbMATH DE number 1390158 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3102166 (Why is no real title available?)
• Index Filtrations and the Homology Index Braid for Partially Ordered Morse Decompositions
• Lattice structures for attractors. I
• Lattice structures for attractors. II
• Leray Functor and Cohomological Conley Index for Discrete Dynamical Systems
• Lyapunov maps, simplicial complexes and the Stone functor
• Morse theory for filtrations and efficient computation of persistent homology
• Morse theory from an algebraic viewpoint
• Multidimensional persistence and noise
• On the global dynamics of attractors for scalar delay equations
• On the groups \(H(\Pi,n)\). I
• Persistence theory. From quiver representations to data analysis
• Simplical models for the global dynamics of attractors
• Stratifying multiparameter persistent homology
• The Connection Matrix in Morse-Smale Flows
• The Connection Matrix Theory for Morse Decompositions
• The Continuation Theory for Morse Decompositions and Connection Matrices
• Transition matrix theory
• Witten's complex and infinite dimensional Morse theory

Cited in

(12)

• conley: Computing connection matrices in Maple
• Lattice structures for attractors. III
• COMPUTATION OF CONNECTION MATRICES USING THE SOFTWARE PACKAGE conley
• scientific article; zbMATH DE number 4069362 (Why is no real title available?)
• A simple derivation of the interactor matrix and its applications
• Principal components along quiver representations
• Computing Connection Matrices via Persistence-Like Reductions
• Homology of configuration spaces of hard squares in a rectangle
• Computing a connection matrix and persistence efficiently from a Morse decomposition
• Data-driven identification of attractors using machine learning
• Graded differential vector spaces, Cartan-Eilenberg systems and conjectures in Conley index theory
• Conley's spectral sequence via the sweeping algorithm

Describes a project that uses

Uses Software

• CHomP
• pyCHomP
• GitHub

This page was built for publication: A computational framework for connection matrix theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239809)