(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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

(Random) Trees of Intermediate Volume Growth

Martin Winter, George Kontogeorgiou
Random Structures and Algorithms
Stochastic processes and statistical mechanics
article

(Random) Trees of Intermediate Volume Growth

Martin Winter, George Kontogeorgiou
article en

Abstract

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.

Random Structures and AlgorithmsVol. 67(4)
Max Planck Institute for Mathematics in the Sciences (DE), Max Planck Institute for Mathematics (DE), University of Chile (CL)
Openalex Percentile: Top 60%
Stochastic processes and statistical mechanics
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.