(Random) Trees of Intermediate Uniform Growth
Abstract
For every sufficiently well-behaved function g:R 0→R 0 that grows at least linearly and at most exponentially we construct a tree T of uniform volume growth g, that is, C1· g(r/4) |BT(v,r)| C2· g(4r), all r 0 and v∈ V(T), where BT(v,r) denotes the ball of radius r centered at a vertex v. In particular, this yields examples of trees of uniform intermediate (i.e. super-polynomial and sub-exponential) volume growth. We use this construction to provide 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 r r.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.