Dualities in persistent (co)homology

@article{Silva2011DualitiesIP,
  title={Dualities in persistent (co)homology},
  author={Vin de Silva and Dmitriy Morozov and Mikael Vejdemo-Johansson},
  journal={ArXiv},
  year={2011},
  volume={abs/1107.5665}
}
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent information. We explain how one can use the existing algorithm for persistent homology to process any of the four modules, and relate it to a recently introduced persistent cohomology algorithm. We present experimental evidence for the practical efficiency of… 

Figures from this paper

The Structure of Morphisms in Persistent Homology, I. Functorial Dualities
TLDR
Duality results for absolute and relative versions of persistent (co)homology are proved, generalizing previous results in terms of barcodes and laying the groundwork for the efficient computation of bar codes for images, kernels, and cokernels of such morphisms.
Distributing Persistent Homology via Spectral Sequences
We set up the theory for a distributive algorithm for computing persistent homology. For this purpose we develop linear algebra of persistence modules. We present bases of persistence modules, and
Persistence modules: Algebra and algorithms
TLDR
A number of facts about persistence modules are presented; ranging from the well-known but under-utilized to the reconstruction of techniques to work in a purely algebraic approach to persistent homology.
Computing Persistent Homology with Various Coefficient Fields in a Single Pass
TLDR
An algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction allows us to infer the prime divisors of the torsion coefficients of the integral homology groups of the topological space at any scale, hence furnishing a more informative description of topology than persistence in asingle coefficient field.
Fast computation of persistent homology representatives with involuted persistent homology
Persistent homology is typically computed through persistent cohomology. While this generally improves the running time significantly, it does not facilitate extraction of homology representatives.
Parallel Computation of Persistent Homology using the Blowup Complex
TLDR
A parallel algorithm that computes persistent homology, an algebraic descriptor of a filtered topological space, by operating on a spatial decomposition of the domain, as opposed to a decomposition with respect to the filtration.
Efficient Computation of Image Persistence
TLDR
An algorithm for computing the barcode of the image of a morphism in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes is presented and can be applied to inclusion-induced maps in persistent absolute homology and persistent relative cohomology for filtrations of pairs of simplicial complexes.
Künneth Formulae in Persistent Homology
TLDR
Künneth-type theorems for the persistent homology of the categorical and tensor product of filtered spaces are proved and two applications are presented: one towards more efficient algorithms for product metric spaces with the maximum metric, and the other recovering persistence homology calculations on the n-torus.
Kunneth formuale in persistent homology
The classical Kunneth formula in algebraic topology describes the homology of a product space in terms of that of its factors. In this paper, we prove Kunneth-type theorems for the persistent
Persistent Homology Computation with a Twist
TLDR
An output-sensitive complexity analysis is given for the new algorithm which yields to sub-cubic asymptotic bounds under certain assumptions and completely avoids reduction on roughly half of the columns.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Computing persistent homology
TLDR
The homology of a filtered d-dimensional simplicial complex K is studied as a single algebraic entity and a correspondence is established that provides a simple description over fields that enables a natural algorithm for computing persistent homology over an arbitrary field in any dimension.
Extending Persistence Using Poincaré and Lefschetz Duality
TLDR
An algebraic formulation is given that extends persistence to essential homology for any filtered space, an algorithm is presented to calculate it, and how it aids the ability to recognize shape features for codimension 1 submanifolds of Euclidean space is described.
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram
Zigzag persistent homology in matrix multiplication time
TLDR
A new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of simplex additions and deletions, which takes O(n3) time in the worst case.
Proximity of persistence modules and their diagrams
TLDR
This paper presents new stability results that do not suffer from the restrictions of existing stability results, and makes it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence.
Topological Persistence and Simplification
TLDR
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
Zigzag Persistence
TLDR
Zigzag persistence generalises the highly successful theory of persistent homology and addresses several situations which are not covered by that theory, and develops theoretical and algorithmic foundations with a view towards applications in topological statistics.
Persistent cohomology and circular coordinates
TLDR
This work develops a machinery of persistent cohomology to identify candidates for significant circle-structures in the data and uses harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves, and suggests that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.
Vines and vineyards by updating persistence in linear time
TLDR
The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering and uses the algorithm to compute 1-parameter families of diagrams which are applied to the study of protein folding trajectories.
On the Local Behavior of Spaces of Natural Images
TLDR
A theoretical model for the high-density 2-dimensional submanifold of ℳ showing that it has the topology of the Klein bottle and a polynomial representation is used to give coordinatization to various subspaces ofℳ.
...
1
2
3
...