• Corpus ID: 8863126

Interactive Visualization of 2-D Persistence Modules

  title={Interactive Visualization of 2-D Persistence Modules},
  author={Michael Lesnick and Matthew L. Wright},
The goal of this work is to extend the standard persistent homology pipeline for exploratory data analysis to the 2-D persistence setting, in a practical, computationally efficient way. To this end, we introduce RIVET, a software tool for the visualization of 2-D persistence modules, and present mathematical foundations for this tool. RIVET provides an interactive visualization of the barcodes of 1-D affine slices of a 2-D persistence module $M$. It also computes and visualizes the dimension of… 
A flat persistence diagram for improved visualization of persistent homology
A modification to the conventional persistence diagram is proposed - the flat persistence diagram - that more efficiently displays information relevant to persistent homology and simultaneously corrects for visual bias present in the former.
Efficient Approximation of Multiparameter Persistence Modules
This article presents the first approximation scheme, which is based on bered barcodes and exact matchings, two constructions that stem from the theory of single-parameter persistence, for computing and decomposing general multi-parameters persistence modules.
Morse-based Fibering of the Persistence Rank Invariant
It is shown how discrete Morse theory may be used to compute the rank invariant, proving that it is completely determined by its values at points whose coordinates are critical with respect to a discrete Morse gradient vector field.
Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules
  • T. Dey, Cheng Xin
  • Computer Science
    Journal of Applied and Computational Topology
  • 2022
A generalization of the persistence algorithm based on a generalized matrix reduction technique that runs in $O(n^{2\omega})$ time where $\omega<2.373$ is the exponent for matrix multiplication.
Pseudo-Multidimensional Persistence and Its Applications
This new approach is able to differentiate between topologically equivalent geometric objects and offers insight into the study of the Kuramoto–Sivashinsky partial differential equation and Lissajous knots.
A User’s Guide to Topological Data Analysis
This article introduces two of the most commonly used topological signatures, the persistence diagram and the mapper graph, which represent loops and holes in the space by considering connectivity of the data points for a continuum of values rather than a single fixed value.
Persistence and Sheaves : from Theory to Applications
This manuscript establishes explicit links between the theory of derived sheaves equipped with the convolu-tion distance (after Kashiwara-Schapira) and persistence theory, and proves that the observable category of persistence mo-dules is equivalent to the well-known category of -sheaves.
Efficient Approximation of the Matching Distance for 2-parameter persistence
This work designs efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired precision $\epsilon>0$ based on a quad-tree refinement strategy introduced by Biasotti et al., but their approach is recast entirely in geometric terms.
Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence
This work improves significantly on the previous fastest algorithm to compute dM by describing an algorithm with expected running time O(n log n), where T (n) is an upper bound for the complexity of deciding if dM ≤ λ.
A T ] 3 0 N ov 2 02 0 Morse-based Fibering of the Persistence Rank Invariant Asilata
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available


Proximity of persistence modules and their diagrams
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.
Vines and vineyards by updating persistence in linear time
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.
A roadmap for the computation of persistent homology
A friendly introduction to PH is given, the pipeline for the computation of PH is navigated with an eye towards applications, and a range of synthetic and real-world data sets are used to evaluate currently available open-source implementations for the computations of PH.
Persistent Homology Computation with a Twist
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.
The Structure and Stability of Persistence Modules
This book is a comprehensive treatment of the theory of persistence modules over the real line. It presents a set of mathematical tools to analyse the structure and to establish the stability of such
Induced Matchings of Barcodes and the Algebraic Stability of Persistence
A simple, explicit map sending a morphism f: M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N shows explicitly how a δ-interleaving morphism between two persistence modules induces aδ-matching between thebarcodes of the two modules.
The Theory of the Interleaving Distance on Multidimensional Persistence Modules
The theory of multidimensional interleavings is developed, with a view toward applications to topological data analysis, and it is shown that when the authors define their persistence modules over a prime field, d_\mathrm{I}$$dI satisfies a universality property.
Topological pattern recognition for point cloud data*
The definition and computation of homology in the standard setting of simplicial complexes and topological spaces are discussed, then it is shown how one can obtain useful signatures, called barcodes, from finite metric spaces, thought of as sampled from a continuous object.
Clear and Compress: Computing Persistent Homology in Chunks
This work presents a parallel algorithm for computing the persistent homology of a filtered chain complex by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix.
Zigzag persistent homology and real-valued functions
The algorithmic results provide a way to compute zigzag persistence for any sequence of homology groups, but combined with the structural results give a novel algorithm for computing extended persistence that is easily parallelizable and uses (asymptotically) less memory.