research
∙
09/04/2023
Thick Forests
We consider classes of graphs, which we call thick graphs, that have the...
share
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...
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
∙
05/16/2020
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
We present a polynomial-time Markov chain Monte Carlo algorithm for esti...
research
∙
02/05/2020
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
We consider the complexity of counting weighted graph homomorphisms defi...
research
∙
09/08/2019
Counting weighted independent sets beyond the permanent
In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the ...
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
∙
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
∙
08/29/2018
Counting Independent Sets in Cocomparability Graphs
We show that the number of independent sets in cocomparability graphs ca...
research
∙
01/19/2018