Vishesh Jain

From MaRDI portal
(Redirected from Vishesh Jain)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Entangled states are typically incomparable
Communications in Mathematical Physics
2026-09-02Paper
The binomial random graph is a bad inducer
Random Structures & Algorithms
2026-05-11Paper
The random graph process is globally synchronizing
Bulletin of the London Mathematical Society
2026-02-04Paper
Equality in Fill's spectral gap problem
(available as arXiv preprint)
2026-01-01Paper
Entropic independence via sparse localization
(available as arXiv preprint)
2026-01-01Paper
Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
(available as arXiv preprint)
2026-01-01Paper
Thinned Quantile Shares are Universally Feasible
(available as arXiv preprint)
2026-01-01Paper
The size of the spanning-tree spectrum of simple graphs
(available as arXiv preprint)
2026-01-01Paper
On the maximum density of r-graphs in which every (r+1)-set spans 0 or 2 edges
(available as arXiv preprint)
2026-01-01Paper
The online monotone array completion problem
(available as arXiv preprint)
2026-01-01Paper
Total variation cutoff for Kac's walk on the sphere
(available as arXiv preprint)
2026-01-01Paper
The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma
(available as arXiv preprint)
2026-01-01Paper
On graphically local versions of metric embeddings
(available as arXiv preprint)
2026-01-01Paper
Optimal girth-dependent bounds for the Bethe approximation of the permanent
(available as arXiv preprint)
2026-01-01Paper
A deterministic (1+\varepsilon)^n approximation for the permanent of a nonnegative matrix
(available as arXiv preprint)
2026-01-01Paper
A general counting and sampling Lovász local lemma
(available as arXiv preprint)
2026-01-01Paper
Entropic independence via sparse localization
Electronic Journal of Probability
2026-01-01Paper
Hitting time mixing for the random transposition walk
Probability Theory and Related Fields
2026-01-01Paper
How fast does the inverse walk approximate a random permutation?2026-01-01Paper
An explicit economical additive basis
Combinatorics, Probability and Computing
2025-12-30Paper
Rapid mixing of the down-up walk on matchings of a fixed size2025-10-06Paper
The edge-statistics conjecture for hypergraphs
IMRN. International Mathematics Research Notices
2025-09-26Paper
Optimal mixing of the down-up walk on independent sets of a given size2025-08-15Paper
Towards the sampling Lovász local lemma2025-08-13Paper
1-factorizations of pseudorandom graphs2025-08-12Paper
The random graph process is globally synchronizing
(available as arXiv preprint)
2025-01-01Paper
Optimal thresholds for Latin squares, Steiner triple systems, and edge colorings2024-11-28Paper
Universality of spectral independence with applications to fast mixing in spin glasses2024-11-28Paper
Optimal Minimization of the Covariance Loss
IEEE Transactions on Information Theory
2024-03-18Paper
An explicit economical additive basis
(available as arXiv preprint)
2024-01-01Paper
Entangled states are typically incomparable
(available as arXiv preprint)
2024-01-01Paper
Rapid mixing of the down-up walk on matchings of a fixed size
(available as arXiv preprint)
2024-01-01Paper
Hitting time mixing for the random transposition walk
(available as arXiv preprint)
2024-01-01Paper
Entropic independence: optimal mixing of down-up random walks
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Approximate counting and sampling via local central limit theorems
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Approximate counting and sampling via local central limit theorems
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Perfectly sampling <i>k</i> ≥ (8/3 + <i>o</i> (1))Δ-colorings in graphs
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
On the smoothed analysis of the smallest singular value with discrete noise
Bulletin of the London Mathematical Society
2023-08-18Paper
Dimension reduction for maximum matchings and the fastest mixing Markov chain
Comptes Rendus. Mathématique. Académie des Sciences, Paris
2023-07-19Paper
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses2023-07-19Paper
The binomial random graph is a bad inducer2023-06-22Paper
Optimal mixing of the down-up walk on independent sets of a given size2023-05-10Paper
On the smallest singular value of symmetric random matrices
Combinatorics, Probability and Computing
2023-03-31Paper
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Mathematical Proceedings of the Cambridge Philosophical Society
2023-02-10Paper
The Smallest Singular Value of Dense Random Regular Digraphs
IMRN. International Mathematics Research Notices
2023-01-18Paper
The binomial random graph is a bad inducer
(available as arXiv preprint)
2023-01-01Paper
Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings2022-12-12Paper
Optimal and algorithmic norm regularization of random matrices
(available as arXiv preprint)
2022-08-18Paper
Spencer's theorem in nearly input-sparsity time2022-06-09Paper
Spectral independence, coupling, and the spectral gap of the Glauber dynamics
Information Processing Letters
2022-06-03Paper
Singularity of discrete random matrices
Geometric and Functional Analysis. GAFA
2022-04-19Paper
Rank deficiency of random matrices
Electronic Communications in Probability
2022-03-11Paper
On the real Davies' conjecture
The Annals of Probability
2022-02-01Paper
The strong circular law: A combinatorial view
Random Matrices: Theory and Applications
2021-12-27Paper
Anticoncentration versus the Number of Subset Sums
Advances in Combinatorics
2021-11-05Paper
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities2021-11-05Paper
Quantitative invertibility of random matrices: a combinatorial perspective
discrete Analysis
2021-09-20Paper
Universality and least singular values of random matrix products: a simplified approach
Bernoulli
2021-09-10Paper
Circular law for random block band matrices with genuinely sublinear bandwidth
Journal of Mathematical Physics
2021-09-06Paper
On the counting problem in inverse Littlewood-Offord theory
Journal of the London Mathematical Society
2021-08-13Paper
A note on the universality of ESDs of inhomogeneous random matrices
(available as arXiv preprint)
2021-08-06Paper
A note on the universality of ESDs of inhomogeneous random matrices2021-08-06Paper
Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
Israel Journal of Mathematics
2021-07-12Paper
Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models2021-06-08Paper
Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics
(available as arXiv preprint)
2021-05-03Paper
On the sampling Lov\'asz Local Lemma for atomic constraint satisfaction problems2021-02-16Paper
Number of 1-factorizations of regular high-degree graphs
Combinatorica
2021-01-25Paper
Anticoncentration versus the number of subset sums
(available as arXiv preprint)
2021-01-19Paper
On the sampling Lovász Local Lemma for atomic constraint satisfaction problems
(available as arXiv preprint)
2021-01-01Paper
Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models
(available as arXiv preprint)
2021-01-01Paper
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities
(available as arXiv preprint)
2021-01-01Paper
1‐Factorizations of pseudorandom graphs
Random Structures & Algorithms
2020-11-30Paper
Towards the sampling Lov\'asz Local Lemma2020-11-24Paper
Sharp invertibility of random Bernoulli matrices2020-10-13Paper
The smallest singular value of dense random regular digraphs
(available as arXiv preprint)
2020-08-11Paper
Towards the linear arboricity conjecture
Journal of Combinatorial Theory. Series B
2020-04-07Paper
Fast and memory-optimal dimension reduction using Kac's walk
(available as arXiv preprint)
2020-03-22Paper
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2020-01-30Paper
The probability of selecting k edge-disjoint Hamilton cycles in the complete graph2020-01-04Paper
The probability of selecting $k$ edge-disjoint Hamilton cycles in the complete graph
(available as arXiv preprint)
2020-01-01Paper
Optimal and algorithmic norm regularization of random matrices
(available as arXiv preprint)
2020-01-01Paper
Sharp invertibility of random Bernoulli matrices
(available as arXiv preprint)
2020-01-01Paper
Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
Forum of Mathematics, Sigma
2019-09-24Paper
Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs2019-03-28Paper
On the k-planar local crossing number
Discrete Mathematics
2019-02-20Paper
Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs
(available as arXiv preprint)
2019-01-01Paper
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity2018-02-16Paper
The Vertex Sample Complexity of Free Energy is Polynomial2018-02-16Paper
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity
(available as arXiv preprint)
2018-01-01Paper
The Vertex Sample Complexity of Free Energy is Polynomial
(available as arXiv preprint)
2018-01-01Paper
Towards the linear arboricity conjecture
(available as arXiv preprint)
2018-01-01Paper
A Counterexample to the "Majority is Least Stable" Conjecture2017-03-22Paper
A Counterexample to the ''Majority is Least Stable'' Conjecture
(available as arXiv preprint)
2017-01-01Paper
On discontinuity of planar optimal transport maps
Journal of Topology and Analysis
2015-05-29Paper


Research outcomes over time


This page was built for person: Vishesh Jain