<p>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 <i>X</i> and a graph <i>G</i>, does there exist a choice of Mapper parameters such that the output Mapper graph of <i>X</i> is isomorphic to <i>G</i>? We provide explicit constructions that affirmatively answer this question. Our results demonstrate that it is possible to select Mapper parameters to generate a given graph, illustrating the flexibility of the Mapper algorithm.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Any Graph is a Mapper Graph

  • Enrique G Alvarado,
  • Robin Belton,
  • Kang-Ju Lee,
  • Sourabh Palande,
  • Sarah Percival,
  • Emilie Purvine,
  • Sarah Tymochko

摘要

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 choice of Mapper parameters such that the output Mapper graph of X is isomorphic to G? We provide explicit constructions that affirmatively answer this question. Our results demonstrate that it is possible to select Mapper parameters to generate a given graph, illustrating the flexibility of the Mapper algorithm.