(Random) Trees of Intermediate Volume Growth
ABSTRACT For every function that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree of uniform volume growth , or more precisely, for constants that only depend on . Here denotes the ball of radius centered at a vertex . In particular, this yields examples of trees of uniform intermediate (i.e., super‐polynomial and sub‐exponential) growth. We use this construction to provide the first examples of unimodular random rooted trees of uniform intermediate growth, answering a question by Itai Benjamini. We find a peculiar change in structural properties for these trees at growth . Our results can be applied to obtain triangulations of for with various uniform growth behaviors, as well as Riemannian metrics on for the same wide range of growth behaviors.
Authors
- Martin Winter (ORCID: https://orcid.org/0000-0003-4176-5811)
- George Kontogeorgiou (ORCID: https://orcid.org/0009-0006-1550-2419)
Institutions
- Max Planck Institute for Mathematics in the Sciences (DE)
- Max Planck Institute for Mathematics (DE)
- University of Chile (CL)
Publication Details
- Journal
- Random Structures and Algorithms
- Published
- 2025-11-06
- DOI
- https://doi.org/10.1002/rsa.70035
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- article
- Field-Weighted Citation Impact
- 0.00