
Entropic Independence in HighDimensional Expanders: Modified LogSobolev Inequalities for Fractionally LogConcave Polynomials and the Ising Model
We introduce a notion called entropic independence for distributions μ d...
read it

Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics
We present a new lower bound on the spectral gap of the Glauber dynamics...
read it

On the sampling Lovász Local Lemma for atomic constraint satisfaction problems
We study the problem of sampling an approximately uniformly random satis...
read it

Anticoncentration versus the number of subset sums
Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any n^2≤ϵ≤ 1, if #{ξ⃗...
read it

Towards the sampling Lovász Local Lemma
Let Φ = (V, 𝒞) be a constraint satisfaction problem on variables v_1,…, ...
read it

On the smoothed analysis of the smallest singular value with discrete noise
Let A be an n× n real matrix, and let M be an n× n random matrix whose e...
read it

Perfectly Sampling k≥ (8/3 +o(1))ΔColorings in Graphs
We present a randomized algorithm which takes as input an undirected gra...
read it

On the real Davies' conjecture
We show that every matrix A ∈R^n× n is at least δ Aclose to a real ...
read it

Kac meets Johnson and Lindenstrauss: a memoryoptimal, fast JohnsonLindenstrauss transform
Based on the Kac random walk on the orthogonal group, we present a fast ...
read it

Smoothed analysis of the least singular value without inverse LittlewoodOfford theory
We study the lower tail behavior of the least singular value of an n× n ...
read it

AccuracyMemory Tradeoffs and Phase Transitions in Belief Propagation
The analysis of Belief Propagation and other algorithms for the reconst...
read it

Towards the linear arboricity conjecture
The linear arboricity of a graph G, denoted by la(G), is the minimum num...
read it

Meanfield approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
The free energy is a key quantity of interest in Ising models, but unfor...
read it

1factorizations of pseudorandom graphs
A 1factorization of a graph G is a collection of edgedisjoint perfect ...
read it

The Vertex Sample Complexity of Free Energy is Polynomial
We study the following question: given a massive Markov random field on ...
read it

The MeanField Approximation: Information Inequalities, Algorithms, and Complexity
The mean field approximation to the Ising model is a canonical variation...
read it

Approximating Partition Functions in Constant Time
We study approximations of the partition function of dense graphical mod...
read it
Vishesh Jain
is this you? claim profile