Følg
Vishesh Jain
Titel
Citeret af
Citeret af
År
Entropic independence: optimal mixing of down-up random walks
N Anari, V Jain, F Koehler, HT Pham, TD Vuong
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
95*2022
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
V Jain, F Koehler, A Risteski
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
442019
On the counting problem in inverse Littlewood–Offord theory
A Ferber, V Jain, K Luh, W Samotij
Journal of the London Mathematical Society 103 (4), 1333-1362, 2021
372021
The mean-field approximation: Information inequalities, algorithms, and complexity
V Jain, F Koehler, E Mossel
Conference On Learning Theory, 1326-1347, 2018
352018
Singularity of random symmetric matrices—a combinatorial approach to improved bounds
A Ferber, V Jain
Forum of Mathematics, Sigma 7, e22, 2019
332019
Singularity of discrete random matrices
V Jain, A Sah, M Sawhney
Geometric and Functional Analysis, 2021
292021
Spectral independence, coupling, and the spectral gap of the Glauber dynamics
V Jain, HT Pham, TD Vuong
Information Processing Letters 177, 106268, 2022
25*2022
Towards the sampling Lovász local lemma
V Jain, HT Pham, TD Vuong
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
242022
Entropic independence ii: optimal sampling and concentration via restricted modified log-Sobolev inequalities
N Anari, V Jain, F Koehler, HT Pham, TD Vuong
arXiv preprint arXiv:2111.03247, 2021
232021
Towards the linear arboricity conjecture
A Ferber, J Fox, V Jain
Journal of Combinatorial Theory, Series B 142, 56-79, 2020
232020
Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
V Jain
Israel Journal of Mathematics 242 (1), 461-500, 2021
212021
Universality of spectral independence with applications to fast mixing in spin glasses
N Anari, V Jain, F Koehler, HT Pham, TD Vuong
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
192024
Optimal thresholds for Latin squares, Steiner triple systems, and edge colorings
V Jain, HT Pham
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
182024
Approximate counting and sampling via local central limit theorems
V Jain, W Perkins, A Sah, M Sawhney
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
182022
ON THE REAL DAVIES’CONJECTURE
V Jain, A Sah, M Sawhney
The Annals of Probability 49 (6), 3011-3031, 2021
182021
On the sampling Lov\'asz Local Lemma for atomic constraint satisfaction problems
V Jain, HT Pham, TD Vuong
arXiv preprint arXiv:2102.08342, 2021
182021
Fast and memory-optimal dimension reduction using Kac’s walk
V Jain, NS Pillai, A Sah, M Sawhney, A Smith
The Annals of Applied Probability 32 (5), 4038-4064, 2022
12*2022
The strong circular law: a combinatorial view
Jain, Vishesh
arXiv preprint https://arxiv.org/abs/1904.11108, 2020
12*2020
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
A Ferber, V Jain, A Sah, M Sawhney
Mathematical Proceedings of the Cambridge Philosophical Society 174 (2), 233-246, 2023
112023
On the smoothed analysis of the smallest singular value with discrete noise
V Jain, A Sah, M Sawhney
Bulletin of the London Mathematical Society 54 (2), 369-388, 2022
112022
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20