Persistence Partial Matchings Induced by Morphisms between Persistence Modules

07/09/2021
by   R. Gonzalez-Diaz, et al.
0

The notion of persistence partial matching, as a generalization of partial matchings between persistence modules, is introduced. We study how to obtain a persistence partial matching 𝒢_f, and a partial matching ℳ_f, induced by a morphism f between persistence modules, both being linear with respect to direct sums of morphisms. Some of their properties are also provided, including their stability after a perturbation of the morphism f, and their relationship with other induced partial matchings already defined in TDA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2021

Zig-Zag Modules: Cosheaves and K-Theory

Persistence modules have a natural home in the setting of stratified spa...
research
01/02/2021

Notes on pivot pairings

We present a row reduction algorithm to compute the barcode decompositio...
research
11/28/2020

Multidimensional Persistence Module Classification via Lattice-Theoretic Convolutions

Multiparameter persistent homology has been largely neglected as an inpu...
research
01/04/2022

On the Persistence of Higher-Order Interactions in Real-World Hypergraphs

A hypergraph is a generalization of an ordinary graph, and it naturally ...
research
09/04/2019

Multifractal Description of Streamflow and Suspended Sediment Concentration Data from Indian River Basins

This study investigates the multifractality of streamflow data of 192 st...
research
04/25/2016

Persistence Lenses: Segmentation, Simplification, Vectorization, Scale Space and Fractal Analysis of Images

A persistence lens is a hierarchy of disjoint upper and lower level sets...
research
07/14/2020

Local Sufficiency for Partial Strategyproofness

In (Mennle and Seuken, 2017), we have introduced partial strategyproofne...

Please sign up or login with your details

Forgot password? Click here to reset