Document Open Access Logo

Meta-Diagrams for 2-Parameter Persistence

Authors Nate Clause, Tamal K. Dey, Facundo Mémoli, Bei Wang

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2023.25.pdf
  • Filesize: 0.85 MB
  • 16 pages

Document Identifiers

Author Details

Nate Clause
  • Ohio State University, Columbus, OH, USA
Tamal K. Dey
  • Purdue University, West Lafayette, IN, USA
Facundo Mémoli
  • Ohio State University, Columbus, OH, USA
Bei Wang
  • University of Utah, Salt Lake City, UT, USA

Funding

  • Clause, Nate: NC is partially supported by NSF CCF 1839356 and NSF DMS 1547357.
  • Dey, Tamal K.: TD is partially supported by NSF CCF 2049010.
  • Mémoli, Facundo: FM is partially supported by BSF 2020124, NSF CCF 1740761, NSF CCF 1839358, and NSF IIS 1901360.
  • Wang, Bei: BW is partially supported by NSF IIS 2145499, NSF IIS 1910733, and DOE DE SC0021015.

Cite AsGet BibTex

Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang. Meta-Diagrams for 2-Parameter Persistence. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.SoCG.2023.25

Abstract

We first introduce the notion of meta-rank for a 2-parameter persistence module, an invariant that captures the information behind images of morphisms between 1D slices of the module. We then define the meta-diagram of a 2-parameter persistence module to be the Möbius inversion of the meta-rank, resulting in a function that takes values from signed 1-parameter persistence modules. We show that the meta-rank and meta-diagram contain information equivalent to the rank invariant and the signed barcode. This equivalence leads to computational benefits, as we introduce an algorithm for computing the meta-rank and meta-diagram of a 2-parameter module M indexed by a bifiltration of n simplices in O(n³) time. This implies an improvement upon the existing algorithm for computing the signed barcode, which has O(n⁴) time complexity. This also allows us to improve the existing upper bound on the number of rectangles in the rank decomposition of M from O(n⁴) to O(n³). In addition, we define notions of erosion distance between meta-ranks and between meta-diagrams, and show that under these distances, meta-ranks and meta-diagrams are stable with respect to the interleaving distance. Lastly, the meta-diagram can be visualized in an intuitive fashion as a persistence diagram of diagrams, which generalizes the well-understood persistence diagram in the 1-parameter setting.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Mathematics of computing → Topology
Keywords
  • Multiparameter persistence modules
  • persistent homology
  • Möbius inversion
  • barcodes
  • computational topology
  • topological data analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Hideto Asashiba, Emerson G Escolar, Ken Nakashima, and Michio Yoshiwaki. On approximation of 2 d persistence modules by interval-decomposables. arXiv preprint arXiv:1911.01637, 2019. Google Scholar
  2. Gorô Azumaya. Corrections and supplementaries to my paper concerning krull-remak-schmidt’s theorem. Nagoya Mathematical Journal, 1:117-124, 1950. Google Scholar
  3. Ulrich Bauer and Maximilian Schmahl. Efficient computation of image persistence. arXiv preprint arXiv:2201.04170, 2022. Google Scholar
  4. Leo Betthauser, Peter Bubenik, and Parker B Edwards. Graded persistence diagrams and persistence landscapes. Discrete & Computational Geometry, 67(1):203-230, 2022. Google Scholar
  5. Magnus Botnan and Michael Lesnick. Algebraic stability of zigzag persistence modules. Algebraic & geometric topology, 18(6):3133-3204, 2018. Google Scholar
  6. Magnus Bakke Botnan, Vadim Lebovici, and Steve Oudot. On rectangle-decomposable 2-parameter persistence modules. Discrete & Computational Geometry, pages 1-24, 2022. Google Scholar
  7. Magnus Bakke Botnan, Steffen Oppermann, and Steve Oudot. Signed barcodes for multi-parameter persistence via rank decompositions. In 38th International Symposium on Computational Geometry (SoCG 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022. Google Scholar
  8. Mickaël Buchet and Emerson G. Escolar. Every 1D persistence module is a restriction of some indecomposable 2D persistence module. Journal of Applied and Computational Topology, 4:387-424, 2020. Google Scholar
  9. Gunnar Carlsson and Afra Zomorodian. The theory of multidimensional persistence. Discrete & Computational Geometry, 42(1):71-93, 2009. Google Scholar
  10. Andrea Cerri, Barbara Di Fabio, Massimo Ferri, Patrizio Frosini, and Claudia Landi. Betti numbers in multidimensional persistent homology are stable functions. Mathematical Methods in the Applied Sciences, 36(12):1543-1557, 2013. Google Scholar
  11. Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang. Meta-diagrams for 2-parameter persistence. arXiv preprint arXiv:2303.08270, 2023. Google Scholar
  12. Nate Clause, Woojin Kim, and Facundo Memoli. The discriminating power of the generalized rank invariant. arXiv preprint arXiv:2207.11591, 2022. Google Scholar
  13. David Cohen-Steiner, Herbert Edelsbrunner, and Dmitriy Morozov. Vines and vineyards by updating persistence in linear time. In Proceedings of the twenty-second annual symposium on Computational geometry, pages 119-126, 2006. Google Scholar
  14. William Crawley-Boevey. Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and its Applications, 14(05):1550066, 2015. Google Scholar
  15. Tamal K. Dey, Woojin Kim, and Facundo Mémoli. Computing generalized rank invariant for 2-parameter persistence modules via zigzag persistence and its applications. In 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, volume 224 of LIPIcs, pages 34:1-34:17, 2022. Google Scholar
  16. Abigail Hickok. Computing persistence diagram bundles. arXiv preprint arXiv:2210.06424, 2022. Google Scholar
  17. Woojin Kim and Facundo Mémoli. Generalized persistence diagrams for persistence modules over posets. Journal of Applied and Computational Topology, 5(4):533-581, 2021. Google Scholar
  18. Claudia Landi. The rank invariant stability via interleavings. In Research in computational topology, pages 1-10. Springer, 2018. Google Scholar
  19. Michael Lesnick. The theory of the interleaving distance on multidimensional persistence modules. Foundations of Computational Mathematics, 15(3):613-650, 2015. Google Scholar
  20. Michael Lesnick and Matthew Wright. Interactive visualization of 2-D persistence modules. arXiv preprint arXiv:1512.00180, 2015. Google Scholar
  21. Alex McCleary and Amit Patel. Bottleneck stability for generalized persistence diagrams. Proceedings of the American Mathematical Society, 148(733), 2020. Google Scholar
  22. Alexander McCleary and Amit Patel. Edit distance and persistence diagrams over lattices. SIAM Journal on Applied Algebra and Geometry, 6(2):134-155, 2022. Google Scholar
  23. Dmitriy Morozov and Amit Patel. Output-sensitive computation of generalized persistence diagrams for 2-filtrations. arXiv preprint arXiv:2112.03980, 2021. Google Scholar
  24. Amit Patel. Generalized persistence diagrams. Journal of Applied and Computational Topology, 1(3):397-419, 2018. Google Scholar
  25. Gian-Carlo Rota. On the foundations of combinatorial theory i. theory of möbius functions. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 2(4):340-368, 1964. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact