DeepAI AI Chat
Log In Sign Up

A Lattice-Theoretic Perspective on the Persistence Map

03/01/2022
by   Brendan Mallery, et al.
EPFL
Tufts University
University at Albany
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

11/28/2020

Multidimensional Persistence Module Classification via Lattice-Theoretic Convolutions

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

Functional Data Representation with Merge Trees

In this paper we face the problem of representation of functional data w...
12/29/2018

Approximate Nearest Neighbors in the Space of Persistence Diagrams

Persistence diagrams are important tools in the field of topological dat...
10/16/2020

Optimizing persistent homology based functions

Solving optimization tasks based on functions and losses with a topologi...
10/14/2020

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to thi...
10/25/2018

Inverse Problems in Topological Persistence

In this survey, we review the literature on inverse problems in topologi...
07/22/2022

Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)

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