Morse theory for filtrations and efficient computation of persistent homology
From MaRDI portal
(Redirected from Publication:368767)
Persistent homology is a growing technique in the analyis of large data sets (see \textit{G. Carlsson} [Topology and data, Bull. Am. Math. Soc., New Ser. 46, No. 2, 255--308 (2009; Zbl 1172.62002)]). The authors of this paper propose a method of reducing the complexity of computing persistent homology by reducing the number of cells in the filtered complex while preserving the homology. The technique is based on an extension of combinatorial Morse theory from complexes to filtrations. The authors describe an algorithm \textit{MorseReduce} that performs a persistent homology preserving reduction on a filtered complex. They show that indeed this reduction preserves persistent homology. The authors evaluate the complexity of the algorithm. Experimental results are given showing the effectiveness of the reduction.
Recommendations
Cites work
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Asymptotically Fast Triangularization of Matrices over Rings
- Barcodes: The persistent topology of data
- Combinatorial algebraic topology
- Computational topology. An introduction
- Computing Optimal Morse Matchings
- Computing persistent homology
- Coreduction homology algorithm
- Coreduction homology algorithm for inclusions and persistent homology
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Discrete Morse theory for free chain complexes
- Efficient Computation of Persistent Homology for Cubical Data
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 1961543 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- scientific article; zbMATH DE number 3102166 (Why is no real title available?)
- Morse theory for cell complexes
- On discrete Morse functions and combinatorial decompositions
- Persistent homology -- a survey
- Smith normal form of dense integer matrices fast algorithms into practice
- Stability of persistence diagrams
- Topological persistence and simplification
- Topology and data
- Topology for Computing
- Toward Optimality in Discrete Morse Theory
- Zigzag persistent homology in matrix multiplication time
Cited in
(only showing first 100 items - show all)- Discrete Morse theory and classifying spaces
- An entropy-based persistence barcode
- Multiscale persistent functions for biomolecular structure characterization
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Rigorous cubical approximation and persistent homology of continuous functions
- Discrete Morse theory and localization
- Topological fidelity and image thresholding: a persistent homology approach
- Simple homotopy theory and nerve theorem for categories
- Analysis of Kolmogorov flow and Rayleigh-Bénard convection using persistent homology
- Continuation of point clouds via persistence diagrams
- Persistent homology in \(\ell_\infty\) metric
- HERMES: persistent spectral graph software
- Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology
- Topological early warning signals: quantifying varying routes to extinction in a spatially distributed population model
- Compression for \(2\)-parameter persistent homology
- Biomolecular topology: modelling and analysis
- Frontiers of sphere recognition in practice
- Magnitude meets persistence: homology theories for filtered simplicial sets
- Topological data analysis for the energy and stability of endohedral metallofullerenes
- Forman-Ricci curvature and persistent homology of unweighted complex networks
- Discrete stratified Morse theory. Algorithms and a user's guide
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
- Aspects of topological approaches for data science
- Persistence of Morse decompositions over grid resolution for maps and time series
- Discrete Morse theory, persistent homology and Forman-Ricci curvature
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Linking combinatorial and classical dynamics: Conley index and Morse decompositions
- Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
- Discrete line fields on surfaces
- Computing invariants for multipersistence via spectral systems and effective homology
- Creating semiflows on simplicial complexes from combinatorial vector fields
- A computational framework for connection matrix theory
- Forman-Ricci flow for change detection in large dynamic data sets
- Discrete Morse theory for computing zigzag persistence
- Local cohomology and stratification
- Divisive cover
- Sliding windows and persistence: an application of topological methods to signal analysis
- Approximation algorithms for Max Morse matching
- Object-oriented persistent homology
- Barcodes of towers and a streaming algorithm for persistent homology
- Decomposing perfect discrete Morse functions on connected sum of 3-manifolds
- Simplification of complexes for persistent homology computations
- Parameter estimation in systems exhibiting spatially complex solutions via persistent homology and machine learning
- Effective homological computations on finite topological spaces
- Topology and local geometry of the Eden model
- Morse inequalities for the Koszul complex of multi-persistence
- Quantifying force networks in particulate systems
- Clique topology reveals intrinsic geometric structure in neural correlations
- On approximations of persistence diagrams
- A topological approach for protein classification
- Discrete Morse theory for computing cellular sheaf cohomology
- Clear and compress: computing persistent homology in chunks
- MORSE REDUCTION FOR ZIGZAG COMPLEXES
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Homological shape analysis through discrete Morse theory
- The Morse Theory of Čech and Delaunay Filtrations
- Elder-rule-staircodes for augmented metric spaces
- Strong Collapse for Persistence
- Persistent Cohomology for Data With Multicomponent Heterogeneous Information
- Bestvina-Brady discrete Morse theory and Vietoris-Rips complexes
- Geometric anomaly detection in data
- Computing persistent homology of flag complexes via strong collapses
- scientific article; zbMATH DE number 7206834 (Why is no real title available?)
- Discrete Stratified Morse Theory: Algorithms and A User's Guide
- Prediction in cancer genomics using topological signatures and machine learning
- Topology of deep neural networks
- Persistent homology for low-complexity models
- Towards the prediction of critical transitions in spatially extended populations with cubical homology
- Learning representations of persistence barcodes
- Distributed computation of persistent homology
- Higher interpolation and extension for persistence modules
- Persistent homology of Morse decompositions in combinatorial dynamics
- Strong collapse and persistent homology
- Weighted persistent homology
- Persistence modules on commutative ladders of finite type
- Persistent homology computation using combinatorial map simplification
- Discrete Morse theory for computing zigzag persistence
- Morse theory of Bestvina–Brady type for posets and matchings
- Persistent pairs and connectedness in discrete Morse functions on simplicial complex. I
- Accelerating Iterated Persistent Homology Computations with Warm Starts
- Move schedules: fast persistence computations in coarse dynamic settings
- Keeping it sparse: computing persistent homology revisited
- Computing hypergraph homology
- Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data
- Unsupervised space-time clustering using persistent homology
- Feature Detection and Hypothesis Testing for Extremely Noisy Nanoparticle Images using Topological Data Analysis
- Some geometric and topological data-driven methods in robot motion path planning
- Multivariate central limit theorems for random clique complexes
- Morse theoretic signal compression and reconstruction on chain complexes
- Bipath persistence
- Analyzing multifiltering functions using multiparameter discrete Morse theory
- Morse complexes and M-torsions of digraphs
- Wrapping cycles in Delaunay complexes: bridging persistent homology and discrete Morse theory
- Geometric bounds for persistence
- Tagged barcodes for the topological analysis of gradient-like vector fields
- On the support of Betti tables of multiparameter persistent homology modules
- Discrete microlocal Morse theory
- Existence of acyclic matching and Morse complex on transitive digraphs
- Coincidence theorems for finite topological spaces
- Persistent homology with k-nearest-neighbor filtrations reveals topological convergence of PageRank
This page was built for publication: Morse theory for filtrations and efficient computation of persistent homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368767)
