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)

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)