Multicoloured Hardcore Model: Fast Mixing and Queueing

We extend the hardcore model to a multicoloured version: a subset of vertices of a graph are coloured such that no vertex is adjacent to one of the same colour; uncoloured vertices do not constrain neighbours. This mathematically models multi-channel resource sharing, such as fibreoptic routing. We analyse certain simple Glauber-type dynamics on such configurations, and find conditions which ensure fast mixing. These dynamics model a queueing system: customers queue for service at vertices, who only serve customers whilst they are coloured in the underlying configuration; uncoloured vertices sit idle. The mixing estimates are applied to control queue lengths in equilibrium.