Abstract
We study the strong spatial mixing (decay of correlation) property of proper q-colorings of random graph G(n, d/n) with a fixed d. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as G(n, d/n), an easy counterexample shows that colorings do not exhibit strong spatial mixing with high probability. Nevertheless, we show that for q ≥ αd + β with α > 2 and sufficiently large β = O(1), with high probability proper q-colorings of random graph G(n, d/n) exhibit strong spatial mixing with respect to an arbitrarily fixed vertex. This is the first strong spatial mixing result for colorings of graphs with unbounded maximum degree. Our analysis of strong spatial mixing establishes a block-wise correlation decay instead of the standard point-wise decay, which may be of interest by itself, especially for graphs with unbounded degree.
The full version of this paper is available at http://arxiv.org/abs/1402.4556
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Annals of Mathematics 162(3), 1335–1351 (2005)
Chung, F., Lu, L.: The diameter of sparse random graphs. Advances in Applied Mathematics 26(4), 257–279 (2001)
Coja-Oghlan, A., Vilenchik, D.: Chasing the k-colorability threshold. In: FOCS, pp. 380–389 (2013)
Dyer, M., Frieze, A.: Randomly coloring random graphs. Random Structures & Algorithms 36(3), 251–272 (2010)
Dyer, M.E., Flaxman, A.D., Frieze, A.M., Vigoda, E.: Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4), 450–465 (2006)
Efthymiou, C.: A simple algorithm for random colouring G (n, d/n) using (2 + ε) d colours. In: SODA, pp. 272–280. SIAM (2012)
Efthymiou, C.: Mcmc sampling colourings and independent sets of G (n, d/n) near the uniqueness threshold (2014)
Efthymiou, C., Spirakis, P.G.: Randomly colouring sparse random graphs using a constant number of colours. Technical report (2007)
Frieze, A., Vigoda, E.: A survey on the use of markov chains to randomly sample colourings. Oxford Lecture Series in Mathematics and its Applications 34, 53 (2007)
Gamarnik, D., Katz, D.: Correlation decay and deterministic FPTAS for counting colorings of a graph. Journal of Discrete Algorithms 12, 29–47 (2012)
Gamarnik, D., Katz, D., Misra, S.: Strong spatial mixing for list coloring of graphs. arXiv preprint arXiv:1207.1223 (2012)
Ge, Q., Stefankovic, D.: Strong spatial mixing of q -colorings on bethe lattices. arXiv preprint arXiv:1102.2886 (2011)
Goldberg, L., Martin, R., Paterson, M.: Strong spatial mixing with fewer colors for lattice graphs. SIAM Journal on Computing 35(2), 486 (2005)
Lu, P., Yin, Y.: Improved FPTAS for multi-spin systems. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) RANDOM 2013 and APPROX 2013. LNCS, vol. 8096, pp. 639–654. Springer, Heidelberg (2013)
Mossel, E., Sly, A.: Rapid mixing of gibbs sampling on graphs that are sparse on average. In: SODA, pp. 238–247 (2008)
Mossel, E., Sly, A.: Gibbs rapidly samples colorings of G(n, d/n). Probability Theory and Related Fields 148(1-2), 37–69 (2010)
Sinclair, A., Srivastava, P., Yin, Y.: Spatial mixing and approximation algorithms for graphs with bounded connective constant. In: FOCS (2013)
Weitz, D.: Mixing in time and space for discrete spin systems. PhD thesis (2004)
Weitz, D.: Counting independent sets up to the tree threshold. In: STOC, pp. 140–149 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, Y. (2014). Spatial Mixing of Coloring Random Graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_89
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)