Colouring random graphs and maximising local diversity

Abstract

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat are adapted to carry out this task. We present experimental results based on two types of random graphs for different system sizes and identify the critical value of the connectivity for the algorithms to find a perfect solution. The problem and the suggested algorithms have practical relevance since various applications, such as distributed storage, can be mapped onto this problem.

10 pages, 10 figures

References in corpus (3)

• Lattice Glass Models
• Random Graph Coloring - a Statistical Physics Approach
• Comparing Beliefs, Surveys and Random Walks

Cited by in corpus (5)

• Partition function loop series for a general graphical model: free energy corrections and message-passing equations
• Minimizing Unsatisfaction in Colourful Neighbourhoods
• Next nearest neighbour Ising models on random graphs
• Palette-colouring: a belief-propagation approach
• The network source location problem: ground state energy, entropy and effects of freezing