We study the approximability of computing the partition functions of
two...
We consider the performance of Glauber dynamics for the random cluster m...
The multi-type Moran process is an evolutionary process on a connected g...
Given a class of graphs ℋ, the problem
⊕𝖲𝗎𝖻(ℋ) is defined as follows. Th...
We study the problems of counting copies and induced copies of a small
p...
We give the first nearly linear time algorithm to approximately sample
s...
In contention resolution, multiple processors are trying to coordinate t...
We study the performance of Markov chains for the q-state ferromagnetic
...
Spectral independence is a recently-developed framework for obtaining sh...
The polymer model framework is a classical tool from statistical mechani...
We study the complexity of approximating the partition function
Z_Ising(...
We study the complexity of approximating the number of answers to a smal...
We study the problem of computing the parity of the number of homomorphi...
Counting the independent sets of a graph is a classical #P-complete prob...
We study the complexity of approximating the partition function of the
q...
A spin system is a framework in which the vertices of a graph are assign...
We give the first efficient algorithm to approximately count the number ...
A retraction is a homomorphism from a graph G to an induced subgraph H o...
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling
alg...
Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling
alg...
We construct a theory of holant clones to capture the notion of
expressi...
In the Ising model, we consider the problem of estimating the covariance...
We study the problem of approximating the value of the matching polynomi...
Let G be a graph that contains an induced subgraph H. A retraction from
...
We consider the problem of sampling from the Potts model on random regul...
We analyse the complexity of approximate counting constraint satisfactio...
The antiferromagnetic q-state Potts model is perhaps the most canonical
...
The Moran process is a randomised algorithm that models the spread of ge...
We study the complexity of approximating the independent set polynomial
...