Universality of persistence diagrams and the bottleneck and Wasserstein distances (Q2144461): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114195523 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1912.02563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for generalized persistence modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust statistics, hypothesis testing, and confidence intervals for persistent homology on metric measure spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of interval decomposable persistence modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic stability of zigzag persistence modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reeb graph edit distance is universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorification of persistent homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity of persistence modules and their diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of exact pfd persistence bimodules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of persistence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz functions have \(L_{p}\)-stable persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERSISTENCE BARCODES FOR SHAPES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural pseudo-distance and optimal matching between reduced size functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of the interleaving distance on multidimensional persistence modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805362 / rank
 
Normal rank

Latest revision as of 08:27, 29 July 2024

scientific article
Language Label Description Also known as
English
Universality of persistence diagrams and the bottleneck and Wasserstein distances
scientific article

    Statements

    Universality of persistence diagrams and the bottleneck and Wasserstein distances (English)
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    Universality of different relevant metrics in topological data analysis refers to the discriminating power of the metrics: a (pseudo)metric \(d\) is universal if for any other metric \(d'\), \(d'(X,Y) \leq d(X,Y)\) for any pair of objects \(X\) and \(Y\); the metrics come with some additional properties, but this is the general form of universality. Universality thus means that a metric is the most discriminating since for any other metric the distances between objects are smaller. For example, the interleaving distance between persistence modules is universal [\textit{M. Lesnick}, Found. Comput. Math. 15, No. 3, 613--650 (2015; Zbl 1335.55006)]. The paper of Bubenik and Elchesen establishes the universality of \(p\)-Wasserstein metrics \(W_p\) for persistence diagrams. The main results are proved in the general setting of metric pairs \((X,d,A),\) where \((X,d)\) is a metric space and \(A \subset X\). For example, the relevant metric pair for persistence diagrams is \((\{(x,y) \in \mathbb{R}^2 \ | \ x \leq y\},d,\Delta),\) where \(d\) is the metric induced by a standard \(q\)-norm and \(\Delta\) is the diagonal \(x=y\). The examples of metric pairs subsume both bottleneck distance and Wasserstein distances. Of interest is the categorical approach in the paper, which might appeal to a reader interested in categorifications of persistence diagrams and their associated metric questions. For any set \(X\), the free commutative monoid is the set of all finite formal sums of elements of \(X\) with addition of formal sums as the monoid operation. Given a pair \((X,A)\), e.g. a metric pair, \(D(X,A)\) is the quotient monoid \(D(X)/D(A)\); \(D(X,A)\) is then the commutative monoid of persistence diagrams on \((X,A)\). The universality theorem now says that given a metric pair \((X,d,A)\), the commutative metric monoid associated to \((X,d,A)\) and given by the quadruple \((D(X,A),W_p,+,0)\), is universal. That is, for any commutative metric monoid \((N,\rho,+,0)\) and 1-Lipschitz map \(\phi \colon (X,d,A) \rightarrow (N,\rho,0)\) there is a unique 1-Lipschitz monoid homomorphism \(\tilde{\phi} \colon (D(X,A),W_p,+,0) \rightarrow (N,\rho,+,0)\) fitting into an appropriate universality diagram.
    0 references
    0 references
    topological data analysis
    0 references
    persistent homology
    0 references
    persistence diagrams
    0 references
    metric pairs
    0 references
    formal sums
    0 references
    0 references
    0 references
    0 references