Year: 2026
Type: preprint
Abstract: We show that every probability-measure-preserving equivalence relation generated by a locally-finite Borel graph with planar connected components is sofic in the sense of Elek--Lippner. In particular, every unimodular random planar graph is sofic. This removes the additional assumptions in the works of Angel--Hutchcroft--Nachmias--Ray and Timár on the soficity of unimodular random planar maps and graphs. To prove this, we investigate Borel simplicial complexes with planar components and approximate them by treeable covering spaces. To construct these coverings, we use a canonical family of tracks on planar simplicial complexes introduced by Dunwoody.
Source: arXiv (Cornell University)
Author: Ishikura, Hiroki
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: 軌道同値関係から見る局所コンパクト群のsofic近似列
OpenAlex ID: W7164010675
Cites:
Cited by:
Related to: