Finitely Dependent Processes on Subshifts
Nishant Chandgotia, Aditya Thorat

TL;DR
This paper investigates the existence and obstructions of stationary finitely dependent processes on subshifts, using cohomology and height functions, with applications to tilings and graph models.
Contribution
It demonstrates the conditions under which finitely dependent processes exist or are obstructed on subshifts, connecting cohomology and tiling problems.
Findings
Dense set of finitely dependent processes supported on strongly mixing subshifts.
Cohomology can obstruct the existence of finitely dependent processes.
Characterization of finitely dependent processes on tilings using height functions.
Abstract
The existence of stationary finitely dependent processes on combinatorial models like subshifts can be quite mysterious. For instance, Holroyd and Liggett constructed such processes on proper -colorings of for all while Holroyd, Schramm and Wilson showed that there are no such processes on proper -colorings of for . In this paper, we take inspiration from these results and investigate them further. On the positive side, we show that there exists a dense set of stationary finitely dependent processes supported on subshifts with strong mixing properties like the finite extension property. On the negative side, we see that the cohomology of the subshifts can form an obstruction to the existence of such processes. In particular we use Conway-Lagarias-Thurston height functions to characterise when there exists a finitely dependent…
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.
