# Any Graph is a Mapper Graph

arXiv: https://arxiv.org/abs/2408.11180 · HTML: https://mlsanity.com/paper/2408.11180/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Aug 2024.

## Built on by (most cited first, 1 of 1)

- [Improving Mapper's Robustness by Varying Resolution According to Lens-Space Density](https://mlsanity.com/paper/2410.03862/) (2024)

## Abstract (arXiv)

The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset X and a graph G, does there exist a set of Mapper parameters such that the output Mapper graph of X is isomorphic to G? We provide constructions that affirmatively answer this question. Our results demonstrate that it is possible to engineer Mapper parameters to generate a desired graph.