Random graph coloring:Statistical physics approach


The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte Carlo simulations. We critically discuss the merits and shortcomings of the various methods, and interpret the results obtained. We present an exact analytical expression for the two-coloring problem as well as general replica symmetric approximated solutions for the thermodynamics of the graph coloring problem with p colors and K-body edges. ©2002 The American Physical Society.

Publication DOI: https://doi.org/10.1103/PhysRevE.66.056120
Divisions: College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Uncontrolled Keywords: graph coloring problem,Monte-Carlo simulations,thermodynamics,Physics and Astronomy(all),Condensed Matter Physics,Statistical and Nonlinear Physics,Mathematical Physics
Publication ISSN: 1550-2376
Last Modified: 07 Feb 2024 08:03
Date Deposited: 11 Mar 2019 17:31
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
https://journal ... sRevE.66.056120 (Publisher URL)
PURE Output Type: Article
Published Date: 2002-11-21
Authors: van Mourik, Jort (ORCID Profile 0000-0002-3172-2714)
Saad, David (ORCID Profile 0000-0001-9821-2623)



Version: Accepted Version

| Preview

Export / Share Citation


Additional statistics for this record