Three lectures on random proper colorings of
arXiv:2001.11566
Abstract
A proper -coloring of a graph is an assignment of one of colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper -colorings of a large discrete cube in the integer lattice . Does the random coloring obtained exhibit any large-scale structure? Does it have fast decay of correlations? We discuss these questions and the way their answers depend on the dimension and the number of colors . The questions are motivated by statistical physics (anti-ferromagnetic materials, square ice), combinatorics (proper colorings, independent sets) and the study of random Lipschitz functions on a lattice. The discussion introduces a diverse set of tools, useful for this purpose and for other problems, including spatial mixing, entropy and coupling methods, Gibbs measures and their classification and refined contour analysis.
arXiv comment56 pages, 13 figures; Based on lectures given at the workshop on Random Walks, Random Graphs and Random Media, September 2019, Munich and at the school Lectures on Probability and Stochastic Processes XIV, December 2019, Delhi. Added figures and made minor improvements to the text in this version. arXiv admin note: text overlap with arXiv:1808.03597
References in corpus (10)
- Absence of Phase Transition for Antiferromagnetic Potts Models via the Dobrushin Uniqueness Theorem
- Uniqueness and non-uniqueness in percolation theory
- Improved Peierls Argument for High Dimensional Ising Models
- Positive association in the fractional fuzzy Potts model
- Two-dimensional Potts antiferromagnets with a phase transition at arbitrarily large q
- Partial long-range order in antiferromagnetic Potts models
- Odd cutsets and the hard-core model on Z^d
- Mixing properties of colorings of the lattice
- Graph-indexed random walks on special classes of graphs
- Algorithmic aspects of -Lipschitz mappings of graphs