The quarter-point theorem for Gromov hyperbolic graphs

Source abstract

Gromov hyperbolicity measures the geometric complexity of metric spaces and metric graphs through geodesic triangles and four-point conditions. While calculating the exact continuous hyperbolicity constant $δ^*(G)$ of a graph $G$ typically requires evaluating quadruples of points over an infinite metric continuum, discretizing this domain is a fundamental challenge in metric graph theory. In this paper, we study the continuous Gromov hyperbolicity constant via the Gromov product. Our main result, the Quarter-Point Theorem, establishes that the search space for quadruples $(x,y,z,w)$ attaining the exact hyperbolicity constant $δ^*(G)$ can be reduced from the entire metric graph to a finite or discrete subset $J'(G)$, comprising solely the vertices, edge midpoints, and quarter-points of $G$. This result holds for every graph, finite or infinite. This theoretical result provides a considerably simplified combinatorial framework for calculating hyperbolicity in complex networks and metric graphs. Furthermore, we exploit this discretization to significantly improve classical results by establishing and structural bounds relating the global hyperbolicity constant $δ^*(G)$ with its restrictions to vertices ($δ_V^*(G)$) and midpoints ($δ_J^*(G)$).