Persistence Diagram Bundles: A Multidimensional Generalization of Vineyards

10/11/2022
βˆ™
by   Abigail Hickok, et al.
βˆ™
0
βˆ™

A persistence diagram (PD) summarizes the persistent homology of a filtration. I introduce the concept of a persistence diagram bundle, which is the space of PDs associated with a fibered filtration function (a set {f_t: 𝒦^t →ℝ}_t βˆˆπ’― of filtrations parameterized by a topological space 𝒯). Special cases include vineyards, the persistent homology transform, and fibered barcodes of multiparameter persistence modules. I prove that if 𝒯 is a compact n-dimensional manifold, then for generic fibered filtration functions, 𝒯 is stratified such that within each n-dimensional stratum S, there is a single PD "template" (a list of birth and death simplices) that can be used to obtain PD(f_t) for any t ∈ S. I also show that not every local section can be extended to a global section. Consequently, the points in the PDs do not typically trace out separate manifolds as t βˆˆπ’― varies; this is unlike a vineyard, in which the points in the PDs trace out curves ("vines").

READ FULL TEXT
research
βˆ™ 10/12/2022

Computing Persistence Diagram Bundles

Persistence diagram (PD) bundles, a generalization of vineyards, were re...
research
βˆ™ 07/03/2023

MΓΆbius Homology

This paper introduces MΓΆbius homology, a homology theory for representat...
research
βˆ™ 11/12/2008

Necessary Conditions for Discontinuities of Multidimensional Size Functions

Some new results about multidimensional Topological Persistence are pres...
research
βˆ™ 01/11/2023

Fast persistent homology computation for functions on ℝ

0-dimensional persistent homology is known, from a computational point o...
research
βˆ™ 11/10/2020

Topological Regularization via Persistence-Sensitive Optimization

Optimization, a key tool in machine learning and statistics, relies on r...
research
βˆ™ 12/03/2020

A Sparse Delaunay Filtration

We show how a filtration of Delaunay complexes can be used to approximat...
research
βˆ™ 02/12/2020

Graph Similarity Using PageRank and Persistent Homology

The PageRank of a graph is a scalar function defined on the node set of ...

Please sign up or login with your details

Forgot password? Click here to reset