Structure and Stability of the One-Dimensional Mapper

given a continuous function (f:xrightarrow 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 graphs, 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.