Pith. sign in

REVIEW 1 cited by

Properties and Stability of Persistence Matching Diagrams

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.14954 v2 pith:324ER2II submitted 2024-09-23 math.AT

classification math.AT
keywords matchingpersistencediagramsembeddingsinducedstabilitymetricresult
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more intuitive than the algebraic one. In addition, we show that such matching diagrams encapsulate the information of persistence morphism images, kernels and cokernels induced by embeddings. The main result is a stability theorem for persistence matching diagrams induced by embeddings. At the end, we adapt our stability result for set injections (not embeddings) of finite metric spaces.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Gromov-Hausdorff distance between chromatic metric pairs and stability of the six-pack

    math.MG 2025-07 conditional novelty 6.0 of 10

    Introduces the C-constrained Gromov-Hausdorff distance for chromatic metric pairs and proves that all six diagrams in a six-pack are stable in bottleneck distance with respect to it, up to a factor of 2.

Pith tools