Enrique G Alvarado, Robin Belton, Kang-Ju Lee, Sourabh Palande, Sarah Percival, Emilie Purvine, Sarah Tymochko
{"title":"任何图表都是映射图表","authors":"Enrique G Alvarado, Robin Belton, Kang-Ju Lee, Sourabh Palande, Sarah Percival, Emilie Purvine, Sarah Tymochko","doi":"arxiv-2408.11180","DOIUrl":null,"url":null,"abstract":"The Mapper algorithm is a popular tool for visualization and data exploration\nin topological data analysis. We investigate an inverse problem for the Mapper\nalgorithm: Given a dataset $X$ and a graph $G$, does there exist a set of\nMapper parameters such that the output Mapper graph of $X$ is isomorphic to\n$G$? We provide constructions that affirmatively answer this question. Our\nresults demonstrate that it is possible to engineer Mapper parameters to\ngenerate a desired graph.","PeriodicalId":501119,"journal":{"name":"arXiv - MATH - Algebraic Topology","volume":"169 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Any Graph is a Mapper Graph\",\"authors\":\"Enrique G Alvarado, Robin Belton, Kang-Ju Lee, Sourabh Palande, Sarah Percival, Emilie Purvine, Sarah Tymochko\",\"doi\":\"arxiv-2408.11180\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Mapper algorithm is a popular tool for visualization and data exploration\\nin topological data analysis. We investigate an inverse problem for the Mapper\\nalgorithm: Given a dataset $X$ and a graph $G$, does there exist a set of\\nMapper parameters such that the output Mapper graph of $X$ is isomorphic to\\n$G$? We provide constructions that affirmatively answer this question. Our\\nresults demonstrate that it is possible to engineer Mapper parameters to\\ngenerate a desired graph.\",\"PeriodicalId\":501119,\"journal\":{\"name\":\"arXiv - MATH - Algebraic Topology\",\"volume\":\"169 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Algebraic Topology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.11180\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Algebraic Topology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.11180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.