Vishesh Jain

collaborators

2 papers

cs.DS2024

Rapid mixing of the down-up walk on matchings of a fixed size

Vishesh Jain, Clayton Mizgerd

Let $G = (V, E)$ be a graph on $n$ vertices and let $m^{*} (G)$ denote the size of a maximum matching in $G$ . We show that for any $δ > 0$ and for any $1 \leq k \leq (1 - δ) m^{*} (G)$ , the d…

math.PR2023

Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses

Nima Anari, Vishesh Jain, Frederic Koehler +2

We study Glauber dynamics for sampling from discrete distributions $μ$ on the hypercube ${\pm 1}^{n}$ . Recently, techniques based on spectral independence have successfully yielded…