Year: 2025
Type: preprint
Abstract: A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$, we prove that every one-ended, unimodular random rooted graph that does not have H as a minor must be sofic. The hypothesis regarding the number of ends can be dropped under the additional assumption that the graph is quasi-transitive.
Source: arXiv (Cornell University)
Author: Solé-Pi, Oriol
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4415194134
Cites:
Cited by:
Related to: