Palette-colouring: a belief-propagation approach

We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call "palette-colouring", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has not been proved to be NP complete, random search algorithms find the problem hard to solve. Heuristics based on a naive belief propagation algorithm are observed to work quite well in certain conditions. In this paper, we build upon the mentioned result, working out the correct belief propagation algorithm, which needs to take into account the many-body nature of the constraints present in this problem. This method improves the naive belief propagation approach, at the cost of increased computational effort. We also investigate the emergence of a satisfiable to unsatisfiable "phase transition" as a function of the vertex mean degree, for different ensembles of sparse random graphs in the large size ("thermodynamic") limit.

[1]  Florent Krzakala,et al.  Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Gerhard Lakemeyer,et al.  Exploring artificial intelligence in the new millennium , 2003 .

[3]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[4]  Marc Mézard,et al.  Lattice glass models. , 2002, Physical review letters.

[5]  David Saad,et al.  Minimizing unsatisfaction in colourful neighbourhoods , 2007, 0704.3835.

[6]  Riccardo Zecchina,et al.  Coloring random graphs , 2002, Physical review letters.

[7]  Florent Krzakala,et al.  Phase Transitions in the Coloring of Random Graphs , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Alessandro Pelizzola,et al.  Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models , 2005, ArXiv.

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

[10]  M. Mézard,et al.  The Bethe lattice spin glass revisited , 2000, cond-mat/0009418.

[11]  Riccardo Zecchina,et al.  Learning by message-passing in networks of discrete synapses , 2005, Physical review letters.

[12]  H. Bethe.  Statistical Theory of Superlattices , 1935 .

[13]  Andrew Zisserman,et al.  Advances in Neural Information Processing Systems (NIPS) , 2007 .

[14]  A. Hasman,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[15]  A Pagnani,et al.  Metastable configurations on the Bethe lattice. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  David P. Landau,et al.  Phase transitions and critical phenomena , 1989, Computing in Science & Engineering.

[17]  M. Opper,et al.  Advanced mean field methods: theory and practice , 2001 .

[18]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  R. Kikuchi.  A Theory of Cooperative Phenomena , 1951 .

[21]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[22]  D Saad,et al.  Coloring random graphs and maximizing local diversity. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.