Bounding the interleaving distance for mapper graphs with a loss function
In this paper, the authors introduce a new method for comparing similarity betwen between data sets consisting of a graph \(G\) and a map \(f: G \rightarrow \mathbb{R}^d\). In particular, using the mapper graph as a discretisation of these data sets. Here, natural transformations can be used to compare the functorial representations, and then obtain a measure of (dis)similarity.\N\NUnfortunately, the diagrams involved do not always commute. To overcome this, the author's method uses families of maps that are not quite natural transformations to measure how far away the diagrams in an interleaving are from commuting.\N\NIn particular, they show that the computations involved have polynomial time given certain input information.
- Algebraic topology of finite topological spaces and applications
- Algorithms in real algebraic geometry
- Assignments to sheaves of pseudometric spaces
- Categorified Reeb graphs
- Computational complexity of the interleaving distance
- Computational homology
- Computing the interleaving distance is NP-hard
- Convergence between categorical representations of Reeb space and mapper
- Decorated merge trees for persistent topology
- Distance Between Sets - A survey
- Distances between immersed graphs: metric properties
- Encyclopedia of distances
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- Homological algebra for persistence modules
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- Intrinsic interleaving distance for merge trees
- Labeled interleaving distance for Reeb graphs
- Map Construction Algorithms
- Metrics for generalized persistence modules
- Probabilistic convergence and stability of random mapper graphs
- Proximity of persistence modules and their diagrams
- Sheaves, objects, and distributed systems
- Statistical analysis and parameter selection for Mapper
- Structure and stability of the one-dimensional Mapper
- The \(\ell^\infty\)-cophenetic metric for phylogenetic trees as an interleaving distance
- The theory of the interleaving distance on multidimensional persistence modules
- Theory of interleavings on categories with a flow
- Tracking network dynamics: a survey using graph distances
This page was built for publication: Bounding the interleaving distance for mapper graphs with a loss function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933054)
