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.
Journal of Computational Geometry , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
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.