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.

[1]  F. Y. Wu.  The Potts model , 1982 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  D. Sherrington,et al.  Graph bipartitioning and spin glasses on a random network of fixed finite valence , 1987 .

[4]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[5]  N. Madras,et al.  THE SELF-AVOIDING WALK , 2006 .

[6]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[7]  Monasson,et al.  Weight space structure and internal representations: A direct approach to learning and generalization in multilayer neural networks. , 1995, Physical review letters.

[8]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[9]  R. Monasson,et al.  Statistical Mechanics of the K--Satisfiability Model , 1996, cond-mat/9606215.

[10]  Michael Molloy,et al.  Almost all graphs with 2.522 n edges are not 3-colorable , 1999, Electron. J. Comb..

[11]  Saad,et al.  Typical performance of gallager-type error-correcting codes , 2000, Physical review letters.

[12]  Saad,et al.  Statistical physics of regular low-density parity-check error-correcting codes , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[13]  D Saad,et al.  Cryptographical properties of Ising spin systems. , 2000, Physical review letters.

[14]  Alexander K. Hartmann,et al.  The number of guards needed by a museum: A phase transition in vertex covering of random graphs , 2000, Physical review letters.

[15]  H. Nishimori.  Statistical Physics of Spin Glasses and Information Processing , 2001 .

[16]  Optimization with Extremal Dynamics , 2000, Physical review letters.

[17]  Joseph C. Culberson,et al.  Frozen development in graph coloring , 2001, Theor. Comput. Sci..

[18]  M. Leone,et al.  Phase coexistence and finite size scaling in random combinatorial problems , 2001 .

[19]  M. Weigt,et al.  Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Riccardo Zecchina,et al.  Hiding solutions in random satisfiability problems: A statistical mechanics approach , 2001, Physical review letters.