Interval Replacements of Persistence Modules
Hideto Asashiba (1, 2, 3), Etienne Gauthier (3, 4), Enhao Liu (5) ((1) Department of Mathematics, Shizuoka University, (2) Osaka Central Advanced Mathematical Institute, Osaka Metropolitan University, (3) Institute for Advanced Study, Kyoto University, (4) \'Ecole Polytechnique

TL;DR
This paper introduces a new framework for interval replacements in persistence modules over finite posets, preserving the interval rank invariant and generalizing previous invariants with explicit formulas and conditions.
Contribution
It defines rank compression systems and interval rank invariants, extending interval decompositions to all persistence modules over finite posets with explicit preservation properties.
Findings
Interval replacement preserves the interval rank invariant.
Provides a formula for the I-rank in terms of structure maps.
Offers an alternative proof of the Dey--Kim--Mémoli theorem.
Abstract
We define two notions. The first one is a for a finite poset that assigns each interval subposet to an order-preserving map satisfying some conditions, where is a connected finite poset. An example is given by the compression system that assigns each to the inclusion of into . The second one is an - of a persistence module under , the family of which is called the of under . A compression system makes it possible to define the (also called the interval-decomposable approximation) not only for 2D persistence modules but also for any persistence modules over any finite poset. We will show that the forming of the interval replacement preserves the interval rank invariant, which is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Topological and Geometric Data Analysis
