Vishesh Jain

According to our database, Vishesh Jain authored at least 34 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings.

Vishesh Jain, Huy Tuan Pham

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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

Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Optimal Minimization of the Covariance Loss.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

IEEE Trans. Inf. Theory, February, 2023

Spencer's theorem in nearly input-sparsity time.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal mixing of the down-up walk on independent sets of a given size.

Vishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy-Duong Vuong

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Spectral independence, coupling, and the spectral gap of the Glauber dynamics.

Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong

Inf. Process. Lett., 2022

On the smallest singular value of symmetric random matrices.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Comb. Probab. Comput., 2022

On the number of Hadamard matrices via anti-concentration.

Asaf Ferber, Vishesh Jain, Yufei Zhao

Comb. Probab. Comput., 2022

Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain.

Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong

CoRR, 2022

Approximate counting and sampling via local central limit theorems.

Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Entropic independence: optimal mixing of down-up random walks.

Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities.

Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong

CoRR, 2021

Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model.

Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong

CoRR, 2021

Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics.

Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong

CoRR, 2021

On the sampling Lovász Local Lemma for atomic constraint satisfaction problems.

Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong

CoRR, 2021

Anticoncentration versus the number of subset sums.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2021

Perfectly sampling <i>k</i> ≥ (8/3 + <i>o</i>(1))Δ-colorings in graphs.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A First Principle Based Investigation on the Effects of Stacking Configuration and Biaxial Strain on the Electronic Properties of Bilayer MoS2.

P. Pranav Anand, Pradyumna Parshi, Vishesh Jain, Swastik Bhattacharya, Arnab Mukhopadhyay, Sayan Kanungo

Proceedings of the 4th International Symposium on Devices, Circuits and Systems, 2021

Towards the sampling Lovász Local Lemma.

Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

1-Factorizations of pseudorandom graphs.

Asaf Ferber, Vishesh Jain

Random Struct. Algorithms, 2020

Towards the linear arboricity conjecture.

Asaf Ferber, Jacob Fox, Vishesh Jain

J. Comb. Theory, Ser. B, 2020

On the smoothed analysis of the smallest singular value with discrete noise.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2020

Perfectly Sampling k≥ (8/3 +o(1))Δ-Colorings in Graphs.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2020

On the real Davies' conjecture.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2020

Kac meets Johnson and Lindenstrauss: a memory-optimal, fast Johnson-Lindenstrauss transform.

Vishesh Jain, Natesh S. Pillai, Aaron Smith

CoRR, 2020

Number of 1-Factorizations of Regular High-Degree Graphs.

Asaf Ferber, Vishesh Jain, Benny Sudakov

Comb., 2020

2019

On the k-planar local crossing number.

John Asplund, Thao Do, Arran Hamm, Vishesh Jain

Discret. Math., 2019

Smoothed analysis of the least singular value without inverse Littlewood-Offord theory.

Vishesh Jain

CoRR, 2019

Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective.

Vishesh Jain, Frederic Koehler, Andrej Risteski

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation.

Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel

Proceedings of the Conference on Learning Theory, 2019

2018

The Vertex Sample Complexity of Free Energy is Polynomial.

Vishesh Jain, Frederic Koehler, Elchanan Mossel

Proceedings of the Conference On Learning Theory, 2018

The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity.

Vishesh Jain, Frederic Koehler, Elchanan Mossel

Proceedings of the Conference On Learning Theory, 2018

2017

Approximating Partition Functions in Constant Time.

Vishesh Jain, Frederic Koehler, Elchanan Mossel

CoRR, 2017

A Counterexample to the "Majority is Least Stable" Conjecture.

Vishesh Jain

CoRR, 2017