A family of metrics from the truncated smoothing of Reeb graphs
Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders

TL;DR
This paper introduces a new family of metrics for Reeb graphs based on truncated smoothing, which generalizes the interleaving distance and offers stability properties, enhancing the analysis of topological data structures.
Contribution
The authors define a novel truncated smoothing technique for Reeb graphs, leading to a family of generalized metrics that extend the interleaving distance with stability properties.
Findings
Defined a truncated smoothing functor for Reeb graphs.
Constructed a categorical flow and interleaving distance for the new metrics.
Showed metrics are strongly equivalent and stable up to a constant.
Abstract
In this paper, we introduce an extension of smoothing on Reeb graphs, which we call truncated smoothing; this in turn allows us to define a new family of metrics which generalize the interleaving distance for Reeb graphs. Intuitively, we "chop off" parts near local minima and maxima during the course of smoothing, where the amount cut is controlled by a parameter . After formalizing truncation as a functor, we show that when applied after the smoothing functor, this prevents extensive expansion of the range of the function, and yields particularly nice properties (such as maintaining connectivity) when combined with smoothing for , where is the smoothing parameter. Then, for the restriction of , we have additional structure which we can take advantage of to construct a categorical flow for any choice of slope…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
