research
∙
01/20/2023
A triangle process on graphs with given degree sequence
The triangle switch Markov chain is designed to generate random graphs w...
share
research
∙
12/23/2020
A triangle process on regular graphs
Switches are operations which make local changes to the edges of a graph...
research
∙
06/22/2020
Sampling hypergraphs with given degrees
There is a well-known connection between hypergraphs and bipartite graph...
research
∙
06/13/2020
Balanced Allocation on Dynamic Hypergraphs
The balls-into-bins model randomly allocates n sequential balls into n b...
research
∙
04/21/2020
On the Parameterised Complexity of Induced Multipartite Graph Parameters
We introduce a family of graph parameters, called induced multipartite g...
research
∙
05/11/2019
Triangle-creation processes on cubic graphs
An edge switch is an operation which makes a local change in a graph whi...
research
∙
03/15/2019
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...
research
∙
12/23/2018
Lower bounds on the chromatic number of random graphs
We prove that a formula predicted on the basis of non-rigorous physics a...
research
∙
12/07/2018
Counting independent sets in graphs with bounded bipartite pathwidth
We show that a simple Markov chain, the Glauber dynamics, can efficientl...
research
∙
07/03/2018
