## The Annals of Probability

### Finitary coloring

#### Abstract

Suppose that the vertices of $\mathbb{Z}^{d}$ are assigned random colors via a finitary factor of independent identically distributed (i.i.d.) vertex-labels. That is, the color of vertex $v$ is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance $R$ of $v$, and the same rule applies at all vertices. We investigate the tail behavior of $R$ if the coloring is required to be proper (i.e., if adjacent vertices must receive different colors). When $d\geq2$, the optimal tail is given by a power law for $3$ colors, and a tower (iterated exponential) function for $4$ or more colors (and also for $3$ or more colors when $d=1$). If proper coloring is replaced with any shift of finite type in dimension $1$, then, apart from trivial cases, tower function behavior also applies.

#### Article information

Source
Ann. Probab., Volume 45, Number 5 (2017), 2867-2898.

Dates
Revised: May 2016
First available in Project Euclid: 23 September 2017

Permanent link to this document
https://projecteuclid.org/euclid.aop/1506132029

Digital Object Identifier
doi:10.1214/16-AOP1127

Mathematical Reviews number (MathSciNet)
MR3706734

Zentralblatt MATH identifier
1385.60048

#### Citation

Holroyd, Alexander E.; Schramm, Oded; Wilson, David B. Finitary coloring. Ann. Probab. 45 (2017), no. 5, 2867--2898. doi:10.1214/16-AOP1127. https://projecteuclid.org/euclid.aop/1506132029

#### References

• [1] Aaronson, J., Gilat, D., Keane, M. and de Valk, V. (1989). An algebraic construction of a class of one-dependent processes. Ann. Probab. 17 128–143.
• [2] Alon, N. and Feldheim, O. N. (2014). A note on general sliding window processes. Electron. Commun. Probab. 19 no. 66, 7.
• [3] Barbu, V. and Precupanu, T. (2012). Convexity and Optimization in Banach Spaces, 4th ed. Springer, Dordrecht.
• [4] Baxter, R. J. (1982). Exactly Solved Models in Statistical Mechanics. Academic Press, New York.
• [5] Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999). Group-invariant percolation on graphs. Geom. Funct. Anal. 9 29–66.
• [6] Burton, R. M., Goulet, M. and Meester, R. (1993). On $1$-dependent processes and $k$-block factors. Ann. Probab. 21 2157–2168.
• [7] Cole, R. and Vishkin, U. (1986). Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70 32–53.
• [8] Cornfeld, I. P., Fomin, S. V. and Sinaĭ, Y. G. (1982). Ergodic Theory. Grundlehren der Mathematischen Wissenschaften 245. Springer, New York.
• [9] Erdős, P., Frankl, P. and Füredi, Z. (1985). Families of finite sets in which no set is covered by the union of $r$ others. Israel J. Math. 51 79–89.
• [10] Galvin, D. (2003). On homomorphisms from the Hamming cube to Z. Israel J. Math. 138 189–213.
• [11] Goldberg, A. V., Plotkin, S. A. and Shannon, G. E. (1988). Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1 434–446.
• [12] Grimmett, G. (1999). Percolation, 2nd ed. Grundlehren der Mathematischen Wissenschaften 321. Springer, Berlin.
• [13] Holroyd, A. E. (2017). One-dependent coloring by finitary factors. Ann. Inst. H. Poincaré Probab. Statist. 53 753–765.
• [14] Holroyd, A. E. and Liggett, T. M. (2016). Finitely dependent coloring. Forum of Math., Pi 4 e9.
• [15] Holroyd, A. E. and Liggett, T. M. (2015). Symmetric 1-dependent colorings of the integers. Electron. Commun. Probab. 20 no. 31, 8.
• [16] Ibragimov, I. A. and Linnik, Y. V. (1971). Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff Publishing, Groningen.
• [17] Janson, S. (1984). Runs in $m$-dependent sequences. Ann. Probab. 12 805–818.
• [18] Linial, N. (1987). Distributive graph algorithms—global solutions from local data. In 28th Annual Symposium on Foundations of Computer Science 331–335. IEEE, New York.
• [19] Linial, N. (1992). Locality in distributed graph algorithms. SIAM J. Comput. 21 193–201.
• [20] Naor, M. (1991). A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discrete Math. 4 409–412.