Random Graph Coloring - a Statistical Physics Approach
统计力学
2009-11-07 v1 无序系统与神经网络
摘要
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 2-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.
引用
@article{arxiv.cond-mat/0207453,
title = {Random Graph Coloring - a Statistical Physics Approach},
author = {J. van Mourik and D. Saad},
journal= {arXiv preprint arXiv:cond-mat/0207453},
year = {2009}
}
备注
17 pages, 9 figures