A Lattice-Theoretic Perspective on the Persistence Map

03/01/2022
by   Brendan Mallery, et al.
0

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up inverse computations, and brings classical tools in combinatorics to bear on an active area of research in topological data analysis (TDA).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2020

Multidimensional Persistence Module Classification via Lattice-Theoretic Convolutions

Multiparameter persistent homology has been largely neglected as an inpu...
research
08/30/2021

Functional Data Representation with Merge Trees

In this paper we face the problem of representation of functional data w...
research
10/16/2020

Optimizing persistent homology based functions

Solving optimization tasks based on functions and losses with a topologi...
research
01/25/2023

Fast Merge Tree Computation via SYCL

A merge tree is a topological descriptor of a real-valued function. Merg...
research
10/14/2020

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to thi...
research
07/31/2023

Lax Liftings and Lax Distributive Laws

Liftings of endofunctors on sets to endofunctors on relations are common...
research
07/22/2022

Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)

This paper presents a computational framework for the Principal Geodesic...

Please sign up or login with your details

Forgot password? Click here to reset