Unimodular random one-ended planar graphs are sofic

DOI10.1017/S0963548323000159MaRDI QIDQ6632781zbMATH OpenFDO

Authors Ádám Timár

Publication date 5 November 2024

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548323000159

zbMATH Keywords

Benjamini-Schramm limitcombinatorial embeddingsoficunimodular random graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Geometric probability and stochastic geometry (60D05)

Review text

Unimodular graphs are random rooted graphs \((G, o)\) having the property that the measure on the space of doubly-rooted graphs\N\[\N\mu := \mathbb{E}\bigg[\sum_{x\in V(G)} \delta_{(G,o,x)}(\cdot)\bigg]\N\]\Nis invariant under the permutation of the two roots. Sofic graphs are those that can be obtained as local limits of uniformly rooted finite graphs and are necessarily unimodular. The converse question ``Is every unimodular graph sofic? is therefore natural but still unanswered except in particular cases, as pointed out in [\textit{D. J. Aldous} and \textit{R. Lyons}, Electron. J. Probab. 12, 1454--1508 (2007; Zbl 1131.60003)].\N\NIn this paper, the author shows that unimodular random one-ended planar graphs are sofic. The key to the proof is to show that every locally finite unimodular random planar graph admits a unimodular combinatorial embedding into the plane (a random decoration of all vertices with a cyclic order on their neighbors that is compatible with an embedding into the plane, such that the graph, additionally marked with this decoration, remains unimodular). This is shown by first reducing the problem to 2-connected graphs, then to their 3-connected components, which have (if they are planar) a unique combinatorial embedding up to a reversal of orientation.\N\NAnother consequence of the main results of this article is that all the dichotomy results of Theorem 1 in [\textit{O. Angel} et al., Geom. Funct. Anal. 28, No. 4, 879--942 (2018; Zbl 1459.60018)] extend to unimodular random one-ended planar graphs.

Recommendations

• Invariant embeddings of unimodular random planar graphs
• A full characterization of invariant embeddability of unimodular planar graphs
• Hyperbolic and parabolic unimodular random maps
• Unimodular random trees
• One-ended spanning trees in amenable unimodular graphs

Cites work

• A full characterization of invariant embeddability of unimodular planar graphs
• Ends of unimodular random manifolds
• Full groups and soficity
• scientific article; zbMATH DE number 3515486 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Hyperbolic and parabolic unimodular random maps
• Hyperlinear and Sofic Groups: A Brief Guide
• Invariant embeddings of unimodular random planar graphs
• Local limits of uniform triangulations in high genus
• On the limit of large girth graph sequences
• One-ended spanning trees in amenable unimodular graphs
• Periodicity and circle packings of the hyperbolic plane
• Planar maps, random walks and circle packing. École d'Été de Probabilités de Saint-Flour XLVIII -- 2018
• Planar stochastic hyperbolic triangulations
• Planarity and duality of finite and infinite graphs
• Processes on unimodular random networks
• Sofic equivalence relations
• The structure of locally finite two-connected graphs
• Unimodular random trees

Cited in

(1)

• A full characterization of invariant embeddability of unimodular planar graphs

This page was built for publication: Unimodular random one-ended planar graphs are sofic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632781)