Structure and Stability of the 1-Dimensional Mapper

Abstract

Given a continuous function $f:X\to \mathbb{R}$ and a cover $\mathcal{I}$ of its image by intervals, the Mapper is the nerve of a refinement of the pullback cover $f^{-1}(\mathcal{I})$. Despite its success in applications, little is known about the structure and stability of this construction from a theoretical point of view. As a pixelized version of the Reeb graph of $f$, it is expected to capture a subset of its features (branches, holes), depending on how the interval cover is positioned with respect to the critical values of the function. Its stability should also depend on this positioning. We propose a theoretical framework that relates the structure of the Mapper to the one of the Reeb graph, making it possible to predict which features will be present and which will be absent in the Mapper given the function and the cover, and for each feature, to quantify its degree of (in-)stability. Using this framework, we can derive guarantees on the structure of the Mapper, on its stability, and on its convergence to the Reeb graph as the granularity of the cover $\mathcal{I}$ goes to zero.

Minor corrections

References in corpus (1)

• Categorified Reeb Graphs

Cited by in corpus (7)

• Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
• Probabilistic Convergence and Stability of Random Mapper Graphs
• The ${\ell }^{\infty }$-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance
• Intrinsic Interleaving Distance for Merge Trees
• Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise
• Bounding the Interleaving Distance for Mapper Graphs with a Loss Function
• Box Filtration