A Unimodular Random Graph With Large Upper Growth and No Growth

ABSTRACT 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.

Authors

Institutions

Publication Details

Journal
Random Structures and Algorithms
Published
2026-05-29
DOI
https://doi.org/10.1002/rsa.70079
Primary Topic
Advanced Graph Theory Research
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A Unimodular Random Graph With Large Upper Growth and No Growth

Ádám Timár, Péter Mester
Random Structures and Algorithms
Advanced Graph Theory Research
preprint

A Unimodular Random Graph With Large Upper Growth and No Growth

Ádám Timár, Péter Mester
preprint en

Abstract

ABSTRACT 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.

Random Structures and AlgorithmsVol. 68(4)
HUN-REN Alfréd Rényi Institute of Mathematics (HU), University of Iceland (IS)
H2020 European Research Council
Openalex Percentile: Top 98%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.