110 research outputs found
Sampling Colourings of the Triangular Lattice
We show that the Glauber dynamics on proper 9-colourings of the triangular
lattice is rapidly mixing, which allows for efficient sampling. Consequently,
there is a fully polynomial randomised approximation scheme (FPRAS) for
counting proper 9-colourings of the triangular lattice. Proper colourings
correspond to configurations in the zero-temperature anti-ferromagnetic Potts
model. We show that the spin system consisting of proper 9-colourings of the
triangular lattice has strong spatial mixing. This implies that there is a
unique infinite-volume Gibbs distribution, which is an important property
studied in statistical physics. Our results build on previous work by Goldberg,
Martin and Paterson, who showed similar results for 10 colours on the
triangular lattice. Their work was preceded by Salas and Sokal's 11-colour
result. Both proofs rely on computational assistance, and so does our 9-colour
proof. We have used a randomised heuristic to guide us towards rigourous
results.Comment: 42 pages. Added appendix that describes implementation. Added
ancillary file
Worm Monte Carlo study of the honeycomb-lattice loop model
We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly
simulates the O(n) loop model on any (finite and connected) bipartite cubic
graph, for any real n>0, and any edge weight, including the fully-packed limit
of infinite edge weight. Furthermore, we prove rigorously that the algorithm is
ergodic and has the correct stationary distribution. We emphasize that by using
known exact mappings when n=2, this algorithm can be used to simulate a number
of zero-temperature Potts antiferromagnets for which the Wang-Swendsen-Kotecky
cluster algorithm is non-ergodic, including the 3-state model on the
kagome-lattice and the 4-state model on the triangular-lattice. We then use
this worm algorithm to perform a systematic study of the honeycomb-lattice loop
model as a function of n<2, on the critical line and in the densely-packed and
fully-packed phases. By comparing our numerical results with Coulomb gas
theory, we identify the exact scaling exponents governing some fundamental
geometric and dynamic observables. In particular, we show that for all n<2, the
scaling of a certain return time in the worm dynamics is governed by the
magnetic dimension of the loop model, thus providing a concrete dynamical
interpretation of this exponent. The case n>2 is also considered, and we
confirm the existence of a phase transition in the 3-state Potts universality
class that was recently observed via numerical transfer matrix calculations.Comment: 33 pages, 12 figure
Rapid Mixing for Lattice Colorings with Fewer Colors
We provide an optimally mixing Markov chain for 6-colorings of the square
lattice on rectangular regions with free, fixed, or toroidal boundary
conditions. This implies that the uniform distribution on the set of such
colorings has strong spatial mixing, so that the 6-state Potts antiferromagnet
has a finite correlation length and a unique Gibbs measure at zero temperature.
Four and five are now the only remaining values of q for which it is not known
whether there exists a rapidly mixing Markov chain for q-colorings of the
square lattice.Comment: Appeared in Proc. LATIN 2004, to appear in JSTA
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
We study Markov chains for -orientations of plane graphs, these are
orientations where the outdegree of each vertex is prescribed by the value of a
given function . The set of -orientations of a plane graph has
a natural distributive lattice structure. The moves of the up-down Markov chain
on this distributive lattice corresponds to reversals of directed facial cycles
in the -orientation. We have a positive and several negative results
regarding the mixing time of such Markov chains.
A 2-orientation of a plane quadrangulation is an orientation where every
inner vertex has outdegree 2. We show that there is a class of plane
quadrangulations such that the up-down Markov chain on the 2-orientations of
these quadrangulations is slowly mixing. On the other hand the chain is rapidly
mixing on 2-orientations of quadrangulations with maximum degree at most 4.
Regarding examples for slow mixing we also revisit the case of 3-orientations
of triangulations which has been studied before by Miracle et al.. Our examples
for slow mixing are simpler and have a smaller maximum degree, Finally we
present the first example of a function and a class of plane
triangulations of constant maximum degree such that the up-down Markov chain on
the -orientations of these graphs is slowly mixing
Sampling grid colourings with fewer colours
We provide an optimally mixing Markov chain for 6-colourings of the square grid. Furthermore, this implies that the uniform distribution on the set of such colourings has strong spatial mixing. 4 and 5 are now the only remaining values of k for which it is not known whether there exists a rapidly mixing Markov chain for k-colourings of the square grid
Frequency reassignment in cellular phone networks
In cellular communications networks, cells use beacon frequencies to ensure the smooth operation of the network, for example in handling call handovers from one cell to another. These frequencies are assigned according to a frequency plan, which is updated from time to time, in response to evolving network requirements. The migration from one frequency plan to a new one proceeds in stages, governed by the network's base station controllers. Existing methods result in periods of reduced network availability or performance during the reassgnment process.
The problem posed to the Study Group was to develop a dynamic reassignment algorithm for implementing a new frequency plan so that there is little or no disruption of the network's performance during the transition. This problem was naturally formulated in terms of graph colouring and an effective algorithm was developed based on a straightforward approach of search and random colouring
Topics in graph colouring and extremal graph theory
In this thesis we consider three problems related to colourings of graphs and one problem in extremal graph theory. Let be a connected graph with vertices and maximum degree . Let denote the graph with vertex set all proper -colourings of and two -colourings are joined by an edge if they differ on the colour of exactly one vertex.
Our first main result states that has a unique non-trivial component with diameter . This result can be viewed as a reconfigurations analogue of Brooks' Theorem and completes the study of reconfigurations of colourings of graphs with bounded maximum degree.
A Kempe change is the operation of swapping some colours , of a component of the subgraph induced by vertices with colour or . Two colourings are Kempe equivalent if one can be obtained from the other by a sequence of Kempe changes. Our second main result states that all -colourings of a graph are Kempe equivalent unless is the complete graph or the triangular prism. This settles a conjecture of Mohar (2007).
Motivated by finding an algorithmic version of a structure theorem for bull-free graphs due to Chudnovsky (2012), we consider the computational complexity of deciding if the vertices of a graph can be partitioned into two parts such that one part is triangle-free and the other part is a collection of complete graphs. We show that this problem is NP-complete when restricted to five classes of graphs (including bull-free graphs) while polynomial-time solvable for the class of cographs.
Finally we consider a graph-theoretic version formulated by Holroyd, Spencer and Talbot (2007) of the famous Erd\H{o}s-Ko-Rado Theorem in extremal combinatorics and obtain some results for the class of trees
- …