A Unimodular Random Graph With Large Upper Growth and No Growth
Random Structures & Algorithms · 2026-07 · 68 (4)
DOI: 10.1002/rsa.70079 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 29.05.2026. Verfasst von Péter Mester und 1 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Gefördert von: H2020 European Research Council.
Abstract (Originalsprache)
We construct a unimodular random rooted graph with maximal degree and upper growth rate , which does not have a growth rate. Abért, Fraczyk and Hayes showed that for a unimodular random tree, if the upper growth rate is at least , then the growth rate exists, and asked with some scepticism if this may hold for more general graphs. Our construction shows that the answer is negative. We also provide a non‐hyperfinite example of a unimodular random graph with no growth rate. This may be of interest in light of a conjecture of Abért that unimodular random Riemannian surfaces of bounded negative curvature always have growth.
Förderung
- H2020 European Research Council
Zitieren
APA
Mester, P., & Timár, Á. (2026). A Unimodular Random Graph With Large Upper Growth and No Growth. Random Structures & Algorithms, 68(4). https://doi.org/10.1002/rsa.70079
Vancouver
Mester P, Timár Á. A Unimodular Random Graph With Large Upper Growth and No Growth. Random Structures & Algorithms. 2026;68(4). doi:10.1002/rsa.70079
BibTeX
@article{Mester2026,
author = {Mester, Péter and Timár, Ádám},
title = {A Unimodular Random Graph With Large Upper Growth and No Growth},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {68},
number = {4},
doi = {10.1002/rsa.70079}
}
EUVIMED