Yi-Ming Chen

Bounds for Feature Sliced Wasserstein Discrepancies via Generic Chaining

Mixing time under monotone censoring

We prove the conjecture of Ding and Mossel~\cite{DM}: the lazy random walk on the discrete cube, censored to any increasing set of fixed positive density, mixes in time $O(n\log n)$. More precisely, for every nonempty increasing set $A\subseteq\{0,1\}^n$, with $a=\mu(A)$ and $\mu$ uniform on the cube, we prove $$ t_{\m...