Macroscopic scalar curvature bounds on graphs
Abstract
We establish sharp lower bounds for the lengths of balls in the universal covers of finite metric graphs. For a finite connected d-regular graph, with d ≥ 3 and average edge length at most one, we show that, at every radius, the average length of balls centered at a vertex of the universal cover is at least that of a ball of the same radius in the equilateral d-regular tree. We extend this comparison to arbitrary finite connected graphs whose total length does not exceed that of an equilateral trivalent graph with the same cyclomatic number. In particular, we show that the maximal length of a ball centered at a vertex of the universal cover is bounded below by that of a ball of the same radius in the equilateral trivalent tree. This answers a question of the first author. Furthermore, equality at an integer radius forces all edges to have unit length in the regular case and, in the general case, forces the graph to be an equilateral trivalent graph after suppressing vertices of degree two. In contrast, rigidity fails at every noninteger radius.
Related
BibTeX
@misc{karam2026macroscopic,
title = {{Macroscopic scalar curvature bounds on graphs}},
author = {Steve Karam and Stéphane Sabourau},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03277},
eprint = {2611.03277},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03277},
}
RIS
TY - UNPB
TI - Macroscopic scalar curvature bounds on graphs
AU - Steve Karam
AU - Stéphane Sabourau
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03277
UR - https://arxiv.org/abs/2611.03277
AB - We establish sharp lower bounds for the lengths of balls in the universal covers of finite metric graphs. For a finite connected d-regular graph, with d ≥ 3 and average edge length at most one, we show that, at every radius, the average length of balls centered at a vertex of the universal cover is at least that of a ball of the same radius in the equilateral d-regular tree. We extend this comparison to arbitrary finite connected graphs whose total length does not exceed that of an equilateral trivalent graph with the same cyclomatic number. In particular, we show that the maximal length of a ball centered at a vertex of the universal cover is bounded below by that of a ball of the same radius in the equilateral trivalent tree. This answers a question of the first author. Furthermore, equality at an integer radius forces all edges to have unit length in the regular case and, in the general case, forces the graph to be an equilateral trivalent graph after suppressing vertices of degree two. In contrast, rigidity fails at every noninteger radius.
ER -