Unimodular random one-ended planar graphs are sofic
From MaRDI portal
Publication:6632781
DOI10.1017/s0963548323000159MaRDI QIDQ6632781
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- On the limit of large girth graph sequences
- Planar stochastic hyperbolic triangulations
- Sofic equivalence relations
- Planarity and duality of finite and infinite graphs
- Periodicity and circle packings of the hyperbolic plane
- The structure of locally finite two-connected graphs
- Invariant embeddings of unimodular random planar graphs
- Local limits of uniform triangulations in high genus
- One-ended spanning trees in amenable unimodular graphs
- Hyperbolic and parabolic unimodular random maps
- Processes on unimodular random networks
- Full groups and soficity
- Planar Maps, Random Walks and Circle Packing
- Unimodular random trees
- Ends of unimodular random manifolds
- Hyperlinear and Sofic Groups: A Brief Guide
- A full characterization of invariant embeddability of unimodular planar graphs
This page was built for publication: Unimodular random one-ended planar graphs are sofic
