
A triangle process on regular graphs
Switches are operations which make local changes to the edges of a graph...
read it

Sampling hypergraphs with given degrees
There is a wellknown connection between hypergraphs and bipartite graph...
read it

Balanced Allocation on Dynamic Hypergraphs
The ballsintobins model randomly allocates n sequential balls into n b...
read it

On the Parameterised Complexity of Induced Multipartite Graph Parameters
We introduce a family of graph parameters, called induced multipartite g...
read it

Trianglecreation processes on cubic graphs
An edge switch is an operation which makes a local change in a graph whi...
read it

The mixing time of the swap (switch) Markov chains: a unified approach
Since 1997 a considerable effort has been spent to study the mixing time...
read it

Lower bounds on the chromatic number of random graphs
We prove that a formula predicted on the basis of nonrigorous physics a...
read it

Counting independent sets in graphs with bounded bipartite pathwidth
We show that a simple Markov chain, the Glauber dynamics, can efficientl...
read it

Uniform generation of spanning regular subgraphs of a dense graph
Let H_n be a graph on n vertices and let H_n denote the complement of H_...
read it
Catherine Greenhill
is this you? claim profile