We study Glauber dynamics for sampling from discrete distributions μ on
...
Let G be a graph on n vertices of maximum degree Δ. We show that,
for an...
We show that the threshold for the binomial random 3-partite, 3-uniform
...
A celebrated theorem of Spencer states that for every set system S_1,…,
...
Let X be a random vector valued in ℝ^m such that X_2≤ 1 almost surely. F...
Let G = (V,E) be an undirected graph with maximum degree Δ and
vertex co...
We introduce a framework for obtaining tight mixing times for Markov cha...
We give an FPTAS for computing the number of matchings of size k in a gr...
We introduce a notion called entropic independence for distributions μ
d...
We present a new lower bound on the spectral gap of the Glauber dynamics...
We study the problem of sampling an approximately uniformly random satis...
Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any
n^-2≤ϵ≤ 1, if
#{ξ⃗...
Let Φ = (V, 𝒞) be a constraint satisfaction problem on
variables v_1,…, ...
Let A be an n× n real matrix, and let M be an n× n random
matrix whose e...
We present a randomized algorithm which takes as input an undirected gra...
We show that every matrix A ∈R^n× n is at least
δ
A-close to a real ...
Based on the Kac random walk on the orthogonal group, we present a fast
...
We study the lower tail behavior of the least singular value of an n×
n ...
The analysis of Belief Propagation and other algorithms for the
reconst...
The linear arboricity of a graph G, denoted by la(G), is the
minimum num...
The free energy is a key quantity of interest in Ising models, but
unfor...
A 1-factorization of a graph G is a collection of edge-disjoint perfect
...
We study the following question: given a massive Markov random field on ...
The mean field approximation to the Ising model is a canonical variation...
We study approximations of the partition function of dense graphical mod...