Computing Connection Matrices via Persistence-Like Reductions

DOI10.1137/23M1562469MaRDI QIDQ6144483zbMATH OpenOpenAlexFDO

Authors Tamal K. Dey, Michał Lipiński, Marian Mrozek, Ryan Slechta

Publication date 29 January 2024

Published in SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

dynamical systempersistenceconnection matrixmatrix reductioncombinatorial (multi) vector fieldConley complex

Mathematics Subject Classification ID

General topology of complexes (57Q05) Triangulating manifolds (57Q15) Discrete Morse theory and related ideas in manifold topology (57Q70)

Abstract: Connection matrices are a generalization of Morse boundary operators from the classical Morse theory for gradient vector fields. Developing an efficient computational framework for connection matrices is particularly important in the context of a rapidly growing data science that requires new mathematical tools for discrete data. Toward this goal, the classical theory for connection matrices has been adapted to combinatorial frameworks that facilitate computation. We develop an efficient persistence-like algorithm to compute a connection matrix from a given combinatorial (multi) vector field on a simplicial complex. This algorithm requires a single-pass, improving upon a known algorithm that runs an implicit recursion executing two-passes at each level. Overall, the new algorithm is more simple, direct, and efficient than the state-of-the-art. Because of the algorithm's similarity to the persistence algorithm, one may take advantage of various software optimizations from topological data analysis.

Recommendations

• A computational framework for connection matrix theory
• Accelerating Iterated Persistent Homology Computations with Warm Starts
• Conley's spectral sequence via the sweeping algorithm
• Matrix method for persistence modules on commutative ladders of finite type
• The Connection Matrix Theory for Morse Decompositions

Cites work

• scientific article; zbMATH DE number 3616736 (Why is no real title available?)
• A computational framework for connection matrix theory
• Barcodes of towers and a streaming algorithm for persistent homology
• Clear and compress: computing persistent homology in chunks
• Combinatorial vector fields and dynamical systems
• Computational homology
• Computational topology for data analysis
• Computational topology. An introduction
• Conley-Morse-Forman theory for combinatorial multivector fields on Lefschetz complexes
• Conley-Morse-Forman theory for generalized combinatorial multivector fields on finite topological spaces
• Creating semiflows on simplicial complexes from combinatorial vector fields
• Dualities in persistent (co)homology
• Efficient Computation of Persistent Homology for Cubical Data
• Homology computation by reduction of chain complexes
• Index Filtrations and the Homology Index Braid for Partially Ordered Morse Decompositions
• Lyapunov maps, simplicial complexes and the Stone functor
• Morse decompositions and connection matrices
• Morse theory for cell complexes
• Optimal discrete Morse functions for 2-manifolds
• Persistence of Conley-Morse graphs in combinatorial dynamical systems
• Persistence of the Conley index in combinatorial dynamical systems
• Persistent homology of Morse decompositions in combinatorial dynamics
• The Connection Matrix Theory for Morse Decompositions
• Topological sorting of large networks
• Towards a formal tie between combinatorial and classical vector field dynamics

Cited in

(1)

• Morse predecomposition of an invariant set

This page was built for publication: Computing Connection Matrices via Persistence-Like Reductions

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