A family of metrics from the truncated smoothing of Reeb graphs

by   Erin Wolf Chambers, et al.

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 0 ≤τ≤ 2ε, where ε is the smoothing parameter. Then, for the restriction of τ∈ [0,ε], we have additional structure which we can take advantage of to construct a categorical flow for any choice of slope m ∈ [0,1]. Using the infrastructure built for a category with a flow, this then gives an interleaving distance for every m ∈ [0,1], which is a generalization of the original interleaving distance, which is the case m=0. While the resulting metrics are not stable, we show that any pair of these for m,m' ∈ [0,1) are strongly equivalent metrics, which in turn gives stability of each metric up to a multiplicative constant. We conclude by discussing implications of this metric within the broader family of metrics for Reeb graphs.


page 1

page 2

page 3

page 4


A Generalized Framework for Edge-preserving and Structure-preserving Image Smoothing

Image smoothing is a fundamental procedure in applications of both compu...

Flow Metrics on Graphs

Given a graph with non-negative edge weights, there are various ways to ...

A Family of Tractable Graph Distances

Important data mining problems such as nearest-neighbor search and clust...

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs

Despite extensive research on distance oracles, there are still large ga...

On constant multi-commodity flow-cut gaps for directed minor-free graphs

The multi-commodity flow-cut gap is a fundamental parameter that affects...

Smoothing complex-valued signals on Graphs with Monte-Carlo

We introduce new smoothing estimators for complex signals on graphs, bas...

Smoothing parameter estimation framework for IBM word alignment models

IBM models are very important word alignment models in Machine Translati...

Please sign up or login with your details

Forgot password? Click here to reset