We study the decay of correlation between locally constrained independen...
We characterize the uniqueness condition in the hardcore model for bipar...
We give a simple combinatorial algorithm to deterministically approximat...
We present a new framework to derandomise certain Markov chain Monte Car...
Distributed graph coloring is one of the most extensively studied proble...
We give a fast algorithm for sampling uniform solutions of general const...
We prove an optimal Ω(n^-1) lower bound for modified log-Sobolev
(MLS) c...
Zero-free based algorithm is a major technique for deterministic approxi...
The single-site dynamics are a canonical class of Markov chains for samp...
We prove an optimal O(n log n) mixing time of the Glauber dynamics for t...
We prove an optimal Ω(n^-1) lower bound on the spectral gap of
Glauber d...
We give a Markov chain based algorithm for sampling almost uniform solut...
We extend the notion of spectral independence (introduced by Anari, Liu,...
The membership problem asks to maintain a set S⊆[u], supporting
insertio...
We give new algorithms based on Markov chains to sample and approximatel...
We show that strong spatial mixing with a rate faster than the growth of...
The Markov chain Monte Carlo (MCMC) methods are the primary tools for
sa...
The Metropolis-Hastings algorithm is a fundamental Markov chain Monte Ca...
We study a new LLL-like framework for rejection sampling, which naturall...
We examine the problem of almost-uniform sampling proper q-colorings of ...
In classic distributed graph problems, each instance on a graph specifie...