2 problems

Let $U$ satisfy Assumption, let $\mu$ be the target distribution, let $\rho(X)$ denote the law of an algorithm's output $X$, let $\mu_0$ be the initial distribution, let $\kappa$ b…

Skewed sampling conjecture. There should be a polynomial-time algorithm that approximately samples uniformly from the set of $\vec{n}$-colorings of $G$ whenever