Interleaving-distance confidence regions for Reeb graphs are obtained from PL proximity-graph estimators, with Mapper treated as a controlled visualization coarsening and extended persistence bounded by twice the interleaving distance.
Categorified Reeb graphs
2 Pith papers cite this work, alongside 59 external citations. Polarity classification is still indexing.
2
Pith papers citing it
59
external citations · OpenAlex
representative citing papers
Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.
citing papers explorer
-
Building confidence regions for Reeb graphs using the interleaving distance
Interleaving-distance confidence regions for Reeb graphs are obtained from PL proximity-graph estimators, with Mapper treated as a controlled visualization coarsening and extended persistence bounded by twice the interleaving distance.
-
Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.