arXiv:1905.00316 [math.MG]AbstractReferencesReviewsResources
Large, lengthy graphs look locally like lines
Itai Benjamini, Tom Hutchcroft
Published 2019-05-01Version 1
We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a graph, there exists a mesoscopic scale on which the graph looks like $\mathbb{R}$ in the sense that the rescaled ball is close to a line segment in the Gromov-Hausdorff metric.
Comments: 8 pages
Related articles: Most relevant | Search more
On the number of tiles visited by a line segment on a rectangular grid
arXiv:1708.04579 [math.MG] (Published 2017-08-07)
Discrete Midpoint Convexity
arXiv:2209.09728 [math.MG] (Published 2022-09-20)
Rotation inside convex Kakeya sets