MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Strong spatial mixing for list coloring of graphs

Author(s)
Gamarnik, David; Katz, Dmitriy; Misra, Sidhant
Thumbnail
DownloadGamarnik_Strong spatial.pdf (148.2Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Alternative title
Strong spatial mixing of list coloring of graphs
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to be #P hard. In the context of coloring, strong spatial mixing has been established for Kelly trees in (Ge and Stefankovic, arXiv:1102.2886v3 (2011)) when q ≥ α[superscript *] Δ + 1 where q the number of colors, Δ is the degree and α[superscript *] is the unique solution to xe[superscript -1/x] = 1. It has also been established in (Goldberg et al., SICOMP 35 (2005) 486–517) for bounded degree lattice graphs whenever q ≥ α[superscript *] Δ - β for some constant β, where Δ is the maximum vertex degree of the graph. We establish strong spatial mixing for a more general problem, namely list coloring, for arbitrary bounded degree triangle-free graphs. Our results hold for any α > α[superscript *] whenever the size of the list of each vertex v is at least αΔ(v) + β where Δ(v) is the degree of vertex v and β is a constant that only depends on α. The result is obtained by proving the decay of correlations of marginal probabilities associated with graph nodes measured using a suitably chosen error function.
Date issued
2013-10
URI
http://hdl.handle.net/1721.1/98838
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Random Structures & Algorithms
Publisher
Wiley Blackwell
Citation
Gamarnik, David, Dmitriy Katz, and Sidhant Misra. “Strong Spatial Mixing of List Coloring of Graphs.” Random Structures & Algorithms 46, no. 4 (October 11, 2013): 599–613.
Version: Original manuscript
ISSN
10429832
1098-2418

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.