Invariant embeddings of unimodular random planar graphs
Abstract
Consider an ergodic unimodular random one-ended planar graph of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally finite" we mean that any bounded open set intersects finitely many embedded edges. In particular, there exist invariant embeddings in the Euclidean plane for the Uniform Infinite Planar Triangulation and for the critical Augmented Galton-Watson Tree conditioned to survive. Roughly speaking, a unimodular embedding of is one that is jointly unimodular with when viewed as a decoration. We show that has a unimodular embedding in the hyperbolic plane if it is invariantly nonamenable, and it has a unimodular embedding in the Euclidean plane if and only if it is invariantly amenable. Similar claims hold for representations by tilings instead of embeddings.
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.