A discrete Hopf-Rinow-theorem
Metric Geometry
2018-07-27 v1 Combinatorics
Abstract
We prove a version of the Hopf-Rinow-theorem with respect to path metrics on discrete spaces. The novel aspect is that we do not a priori assume local finiteness but isolate a local finiteness type condition, called essential local finiteness, that is indeed necessary. As a side product we identify the maximal weight, called the geodesic weight, which generates the path metric in the situation when the space is complete with respect to any of the equivalent notions of completeness proven in the Hopf-Rinow theorem. As an application, we characterize the graphs for which the resistance metric is a path metric induced by the graph structure.
Cite
@article{arxiv.1807.10080,
title = {A discrete Hopf-Rinow-theorem},
author = {Matthias Keller and Florentin Münch},
journal= {arXiv preprint arXiv:1807.10080},
year = {2018}
}