Large, lengthy graphs look locally like lines

DOI10.1112/BLMS.12436zbMath1467.05059arXiv1905.00316OpenAlexW2942915725MaRDI QIDQ4999667

Itai Benjamini, Tom Hutchcroft

Publication date: 2 July 2021

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.00316

zbMATH Keywords

Gromov-Hausdorff metricunimodular random rooted graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Metric geometry (51F99) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Horofunctions on graphs of linear growth
• Infinite clusters in dependent automorphism invariant percolation on trees
• Recurrence of distributional limits of finite planar graphs
• On the scaling limit of finite vertex transitive graphs with large diameter
• Processes on unimodular random networks
• Probability theory. A comprehensive course.

This page was built for publication: Large, lengthy graphs look locally like lines