Sofic actions on graphs
David Gao, Greg Patchell, Srivatsav Kunnawalkam Elayavalli

TL;DR
This paper develops a comprehensive theory of sofic actions on graphs, establishing new stability properties, characterizations, and examples, significantly advancing the understanding of sofic groups and their actions.
Contribution
It introduces a unified framework for sofic actions on graphs, proves preservation under various operations, and provides new examples, including graph wreath products, enriching the class of known sofic groups.
Findings
Soficity is preserved by graph join operations.
Group actions on Cayley graphs are sofic iff the group is sofic.
Actions of amenable and free groups on graphs are sofic.
Abstract
We develop a theory of soficity for actions on graphs and obtain new applications to the study of sofic groups. We establish various examples, stability and permanence properties of sofic actions on graphs, in particular soficity is preserved by taking several natural graph join operations. We prove that an action of a group on its Cayley graph is sofic if and only if the group is sofic. We show that arbitrary actions of amenable groups on graphs are sofic. Using a graph theoretic result of E. Hrushovski, we also show that arbitrary actions of free groups on graphs are sofic. Notably we show that arbitrary actions of sofic groups on graphs, with amenable stabilizers, are sofic, settling completely an open problem from \cite{gao2024soficity}. We also show that soficity is preserved by taking limits under a natural Gromov-Hausdorff topology, generalizing prior work of the first author…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLinguistics and Discourse Analysis · Advanced Graph Theory Research
