Lower Bounding the Gromov--Hausdorff distance in Metric Graphs (2411.09182v1)

Abstract: Let $G$ be a compact, connected metric graph and let $X\subseteq G$ be a subset. If $X$ is sufficiently dense in $G$, we show that the Gromov--Hausdorff distance matches the Hausdorff distance, namely $d_{GH}(G,X)=d_{H}(G,X)$. In a recent study, when the metric graph is the circle $G=S^1$ with circumference $2\pi$, the equality $d_{GH}(S^1,X)=d_{H}(S^1,X)$ was established whenever $d_{GH}(S^1,X)<\frac{\pi}{6}$. Our result for general metric graphs relaxes this hypothesis in the circle case to $d_{GH}(S^1,X)<\frac{\pi}{3}$, and furthermore, we give an example showing that the constant $\frac{\pi}{3}$ is the best possible. We lower bound the Gromov--Hausdorff distance $d_{GH}(G,X)$ by the Hausdorff distance $d_{H}(G,X)$ via a simple topological obstruction: showing a correspondence with too small distortion contradicts the connectedness of $G$. Moreover, for two sufficiently dense subsets $X,Y\subseteq G$, we provide new lower bounds on $d_{GH}(X,Y)$ in terms of the Hausdorff distance $d_{H}(X,Y)$, which is $O(n^2)$-time computable if the subsets have at most $n$ points.