Vishesh Jain

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Optimal mixing of the down-up walk on independent sets of a given size	2023	Vishesh Jain Marcus Michelen Huy Tuan Pham Thuy-Duong Vuong
+ PDF Chat	Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain	2023	Vishesh Jain Huy Tuan Pham Thuy-Duong Vuong
+ PDF Chat	Spencer's theorem in nearly input-sparsity time	2023	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Optimal mixing of the down-up walk on independent sets of a given size	2023	Vishesh Jain Marcus Michelen Huy Tuan Pham Thuy-Duong Vuong
+	The binomial random graph is a bad inducer	2023	Vishesh Jain Marcus Michelen
+	Optimal and algorithmic norm regularization of random matrices	2022	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain	2022	Vishesh Jain Huy Tuan Pham Thuy-Duong Vuong
+	Optimal minimization of the covariance loss	2022	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Spencer's theorem in nearly input-sparsity time	2022	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings	2022	Vishesh Jain Huy Tuan Pham
+	Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities	2021	Nima Anari Vishesh Jain Frederic Koehler Huy Tuan Pham Thuy-Duong Vuong
+	Approximate counting and sampling via local central limit theorems	2021	Vishesh Jain Will Perkins Ashwin Sah Mehtaab Sawhney
+	Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models	2021	Nima Anari Vishesh Jain Frederic Koehler Huy Tuan Pham Thuy-Duong Vuong
+	Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial	2021	Asaf Ferber Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Rank deficiency of random matrices	2021	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Anticoncentration versus the number of subset sums	2021	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Optimal and algorithmic norm regularization of random matrices	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Towards the sampling Lovász Local Lemma	2020	Vishesh Jain Huy Tuan Pham Thuy Duong Vuong
+	On the smallest singular value of symmetric random matrices	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Singularity of discrete random matrices	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	On the smoothed analysis of the smallest singular value with discrete noise	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	The smallest singular value of dense random regular digraphs	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Universality and least singular values of random matrix products: a simplified approach	2020	Rohit Chaudhuri Vishesh Jain Natesh S. Pillai
+	A note on the universality of ESDs of inhomogeneous random matrices	2020	Vishesh Jain Sandeep Silwal
+	On the real Davies' conjecture	2020	Vishesh Jain Ashwin Sah Mehtaab Sawhney
+	Fast and memory-optimal dimension reduction using Kac's walk	2020	Vishesh Jain Natesh S. Pillai Ashwin Sah Mehtaab Sawhney Aaron Smith
+	The strong circular law: a combinatorial view	2019	Vishesh Jain
+	On the counting problem in inverse Littlewood--Offord theory	2019	Asaf Ferber Vishesh Jain Kyle Luh Wojciech Samotij
+	Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices	2019	Vishesh Jain
+	Towards the linear arboricity conjecture	2018	Asaf Ferber Jacob Fox Vishesh Jain
+	Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective	2018	Vishesh Jain Frederic Koehler Andrej Risteski
+	1-factorizations of pseudorandom graphs	2018	Asaf Ferber Vishesh Jain
+	On the k-planar local crossing number	2018	John Asplund Thao Do Arran Hamm Vishesh Jain
+	Number of 1-factorizations of regular high-degree graphs	2018	Asaf Ferber Vishesh Jain Benny Sudakov
+	Approximating Partition Functions in Constant Time	2017	Vishesh Jain Frederic Koehler Elchanan Mossel

Common Coauthors

Coauthor	Papers Together
Mehtaab Sawhney	15
Ashwin Sah	15
Huy Tuan Pham	8
Thuy-Duong Vuong	6
Asaf Ferber	5
Frederic Koehler	4
Marcus Michelen	3
Natesh S. Pillai	2
Nima Anari	2
Andrej Risteski	1
Elchanan Mossel	1
Kyle Luh	1
Arran Hamm	1
Will Perkins	1
Rohit Chaudhuri	1
Benny Sudakov	1
Aaron Smith	1
Thao Do	1
Thuy Duong Vuong	1
John Asplund	1
Sandeep Silwal	1
Jacob Fox	1
Wojciech Samotij	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Logarithmic Sobolev inequality for some models of random walks	1998	Tzong-Yow Lee Horng‐Tzer Yau	1
+	Efficient Algorithms for Discrepancy Minimization in Convex Sets	2014	Ronen Eldan Mohit Singh	1
+ PDF Chat	Bounding Fastest Mixing	2005	Sébastien Roch	1
+ PDF Chat	Modified Logarithmic Sobolev Inequalities in Discrete Settings	2006	Sergey G. Bobkov Prasad Tetali	1
+	Counting in two-spin models on d-regular graphs	2014	Allan Sly Nike Sun	1
+ PDF Chat	The Complexity of Approximating Vertex Expansion	2013	Anand Louis Prasad Raghavendra Santosh Vempala	1
+	Counting independent sets up to the tree threshold	2006	Dror Weitz	1
+	The complexity of computing the permanent	1979	Leslie G. Valiant	1
+	Roth’s estimate of the discrepancy of integer sequences is nearly sharp	1981	József Beck	1
+	Lee-Yang theory and normal fluctuations	1979	D. Iagolnitzer Bernard Souillard	1
+ PDF Chat	Sublinear optimization for machine learning	2012	Kenneth L. Clarkson Elad Hazan David P. Woodruff	1
+	Dimer problem in statistical mechanics-an exact result	1961	H. N. V. Temperley Michael E. Fisher	1
+ PDF Chat	Logarithmic Sobolev inequalities for finite Markov chains	1996	Persi Diaconis Laurent Saloff‐Coste	1
+ PDF Chat	Constructive Discrepancy Minimization by Walking on the Edges	2015	Shachar Lovett Raghu Meka	1
+ PDF Chat	On Tail Probabilities for Martingales	1975	David A. Freedman	1
+	EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES	1989	E. D. Gluskin	1
+	Semidefinite programming in combinatorial optimization	1997	Michel X. Goemans	1
+ PDF Chat	Fastest Mixing Markov Chain on a Graph	2004	Stephen Boyd Persi Diaconis Lin Xiao	1
+	“Integer-making” theorems	1981	József Beck Tibor Fiala	1
+ PDF Chat	Path coupling: A technique for proving rapid mixing in Markov chains	2002	Russ Bubley Martin Dyer	1
+ PDF Chat	Constructive Algorithms for Discrepancy Minimization	2010	Nikhil Bansal	1
+ PDF Chat	Constructive Discrepancy Minimization for Convex Sets	2017	Thomas Rothvoß	1
+ PDF Chat	Performance of Johnson-Lindenstrauss transform for <i>k</i> -means and <i>k</i> -medians clustering	2019	Konstantin Makarychev Yury Makarychev Ilya Razenshteyn	1
+	Multivariate CLT follows from strong Rayleigh property	2017	Subhroshekhar Ghosh Thomas M. Liggett Robin Pemantle	1
+ PDF Chat	On a Conjecture of Sokal Concerning Roots of the Independence Polynomial	2018	Han Peters Guus Regts	1
+ PDF Chat	Local Spectral Expansion Approach to High Dimensional Expanders Part I: Descent of Spectral Gaps	2017	Izhar Oppenheim	1
+ PDF Chat	Nearly linear-time packing and covering LP solvers	2018	Zeyuan Allen-Zhu Lorenzo Orecchia	1
+ PDF Chat	Computational Transition at the Uniqueness Threshold	2010	Allan Sly	1
+	Central limit theorems, Lee–Yang zeros, and graph-counting polynomials	2016	Joel L. Lebowitz Boris Pittel David Ruelle Eugène R. Speer	1
+ PDF Chat	Optimality of the Johnson-Lindenstrauss Lemma	2017	Kasper Green Larsen Jelani Nelson	1
+	Central limit theorems and the geometry of polynomials	2019	Marcus Michelen Julian Sahasrabudhe	1
+ PDF Chat	Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs	2019	Gesine Reinert Nathan Ross	1
+ PDF Chat	Stein’s method for stationary distributions of Markov chains and application to Ising models	2019	Guy Bresler Anant Raj	1
+	Central limit theorems from the roots of probability generating functions	2019	Marcus Michelen Julian Sahasrabudhe	1
+	Balancing vectors and Gaussian measures of n-dimensional convex bodies	1998	BanaszczykWojciech	1
+ PDF Chat	A sharp log-Sobolev inequality for the multislice	2021	Justin Salez	1
+ PDF Chat	Improved analysis of higher order random walks and applications	2020	Vedat Levi Alev Lap Chi Lau	1
+ PDF Chat	Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model	2020	Nima Anari Kuikui Liu Shayan Oveis Gharan	1
+ PDF Chat	Coordinate Methods for Matrix Games	2020	Yair Carmon Yujia Jin Aaron Sidford Kevin Tian	1
+	A Gaussian fixed point random walk	2021	Yang P. Liu Ashwin Sah Mehtaab Sawhney	1
+ PDF Chat	Discrepancy minimization via a self-balancing walk	2021	Ryan Alweiss Yang P. Liu Mehtaab Sawhney	1
+ PDF Chat	Spectral Independence via Stability and Applications to Holant-Type Problems	2022	Zongchen Chen Kuikui Liu Eric Vigoda	1
+ PDF Chat	Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion	2021	Zongchen Chen Kuikui Liu Eric Vigoda	1
+ PDF Chat	Approximate counting and sampling via local central limit theorems	2022	Vishesh Jain Will Perkins Ashwin Sah Mehtaab Sawhney	1
+ PDF Chat	Log-Sobolev inequality for the multislice, with applications	2022	Yuval Filmus Ryan O’Donnell Xinyu Wu	1
+	Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities	2021	Nima Anari Vishesh Jain Frederic Koehler Huy Tuan Pham Thuy-Duong Vuong	1
+	Geometric Bounds on the Fastest Mixing Markov Chain	2021	Sam Olesker-Taylor Luca Zanetti	1
+	The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction	2022	Moses Charikar Erik Waingarten	1
+ PDF Chat	Convex Optimization: Algorithms and Complexity	2015	Sébastien Bubeck	1
+	Dimensionality reduction: beyond the Johnson-Lindenstrauss bound	2011	Yair Bartal Ben Recht Leonard J. Schulman	1