63 citations · 270 across the 27 of their papers we have counts for
35 papers
Triangle processes on graphs with given degree sequence
Colin Cooper, Martin Dyer, Catherine Greenhill
The switch chain is a well-studied Markov chain which generates random graphs with a given degree sequence and has uniform stationary distribution. Motivated by the high number of…
A triangle process on regular graphs
Colin Cooper, Martin Dyer, Catherine Greenhill
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called trian…
Sampling hypergraphs with given degrees
Martin Dyer, Catherine Greenhill, Pieter Kleer +2
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite grap…
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
Martin Dyer, Marc Heinrich, Mark Jerrum +1
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the al…
Counting weighted independent sets beyond the permanent
Martin Dyer, Mark Jerrum, Haiko Muller +1
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition…
Triangle-creation processes on cubic graphs
Colin Cooper, Martin Dyer, Catherine Greenhill
An edge switch is an operation which makes a local change in a graph while maintaining the degree of every vertex. We introduce a switch move, called a triangle switch, which creat…