Computing Topological Persistence for Simplicial Maps. Dey, T. K.; Fan, F.; and Wang, Y. In Proceedings of the Thirtieth Annual Symposium on Computational Geometry, of SOCG'14, pages 345:345–345:354. ACM.
Computing Topological Persistence for Simplicial Maps [link]Paper  doi  abstract   bibtex   
Algorithms for persistent homology are well-studied where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under Z2 coefficients for a (monotone) sequence of general simplicial maps and show how these maps arise naturally in some applications of topological data analysis. A simplicial map can be decomposed into a set of elementary inclusions and vertex collapses–two atomic operations that can be supported efficiently with the notion of simplex annotations for computing persistent homology. A consistent annotation through these atomic operations implies the maintenance of a consistent cohomology basis, hence a homology basis by duality. While the idea of maintaining a cohomology basis through an inclusion is not new, maintaining them through a vertex collapse is new, which constitutes an important atomic operation for simulating simplicial maps. Annotations support the vertex collapse in addition to the usual inclusion quite naturally. Finally, we exhibit an application of this new tool in which we approximate the persistence diagram of a filtration of Rips complexes where vertex collapses are used to tame the blow-up in size.
@inproceedings{deyComputingTopologicalPersistence2014,
  location = {{New York, NY, USA}},
  title = {Computing {{Topological Persistence}} for {{Simplicial Maps}}},
  isbn = {978-1-4503-2594-3},
  url = {http://doi.acm.org/10.1145/2582112.2582165},
  doi = {10.1145/2582112.2582165},
  abstract = {Algorithms for persistent homology are well-studied where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under Z2 coefficients for a (monotone) sequence of general simplicial maps and show how these maps arise naturally in some applications of topological data analysis. A simplicial map can be decomposed into a set of elementary inclusions and vertex collapses--two atomic operations that can be supported efficiently with the notion of simplex annotations for computing persistent homology. A consistent annotation through these atomic operations implies the maintenance of a consistent cohomology basis, hence a homology basis by duality. While the idea of maintaining a cohomology basis through an inclusion is not new, maintaining them through a vertex collapse is new, which constitutes an important atomic operation for simulating simplicial maps. Annotations support the vertex collapse in addition to the usual inclusion quite naturally. Finally, we exhibit an application of this new tool in which we approximate the persistence diagram of a filtration of Rips complexes where vertex collapses are used to tame the blow-up in size.},
  booktitle = {Proceedings of the {{Thirtieth Annual Symposium}} on {{Computational Geometry}}},
  series = {{{SOCG}}'14},
  publisher = {{ACM}},
  urldate = {2018-04-20},
  date = {2014},
  pages = {345:345--345:354},
  keywords = {cohomology,homology,simplicial maps,topological data analysis,Topological persistence},
  author = {Dey, Tamal K. and Fan, Fengtao and Wang, Yusu},
  file = {/home/dimitri/Nextcloud/Zotero/storage/X6R4GKRU/Dey et al. - 2014 - Computing Topological Persistence for Simplicial M.pdf}
}
Downloads: 0