| Publication | Date of Publication | Type |
|---|
Entangled states are typically incomparable
Communications in Mathematical Physics | 2026-09-02 | Paper |
The binomial random graph is a bad inducer
Random Structures & Algorithms | 2026-05-11 | Paper |
The random graph process is globally synchronizing
Bulletin of the London Mathematical Society | 2026-02-04 | Paper |
An explicit economical additive basis
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
| Rapid mixing of the down-up walk on matchings of a fixed size | 2025-10-06 | Paper |
The edge-statistics conjecture for hypergraphs
IMRN. International Mathematics Research Notices | 2025-09-26 | Paper |
| Optimal mixing of the down-up walk on independent sets of a given size | 2025-08-15 | Paper |
| Towards the sampling Lovász local lemma | 2025-08-13 | Paper |
| 1-factorizations of pseudorandom graphs | 2025-08-12 | Paper |
| Optimal thresholds for Latin squares, Steiner triple systems, and edge colorings | 2024-11-28 | Paper |
| Universality of spectral independence with applications to fast mixing in spin glasses | 2024-11-28 | Paper |
Optimal Minimization of the Covariance Loss
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Entropic independence: optimal mixing of down-up random walks
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Approximate counting and sampling via local central limit theorems
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Approximate counting and sampling via local central limit theorems
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
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-14 | Paper |
On the smoothed analysis of the smallest singular value with discrete noise
Bulletin of the London Mathematical Society | 2023-08-18 | Paper |
Dimension reduction for maximum matchings and the fastest mixing Markov chain
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2023-07-19 | Paper |
| Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses | 2023-07-19 | Paper |
| The binomial random graph is a bad inducer | 2023-06-22 | Paper |
| Optimal mixing of the down-up walk on independent sets of a given size | 2023-05-10 | Paper |
On the smallest singular value of symmetric random matrices
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Mathematical Proceedings of the Cambridge Philosophical Society | 2023-02-10 | Paper |
The Smallest Singular Value of Dense Random Regular Digraphs
IMRN. International Mathematics Research Notices | 2023-01-18 | Paper |
| Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings | 2022-12-12 | Paper |
Optimal and algorithmic norm regularization of random matrices
(available as arXiv preprint) | 2022-08-18 | Paper |
| Spencer's theorem in nearly input-sparsity time | 2022-06-09 | Paper |
Spectral independence, coupling, and the spectral gap of the Glauber dynamics
Information Processing Letters | 2022-06-03 | Paper |
Singularity of discrete random matrices
Geometric and Functional Analysis. GAFA | 2022-04-19 | Paper |
Rank deficiency of random matrices
Electronic Communications in Probability | 2022-03-11 | Paper |
On the real Davies' conjecture
The Annals of Probability | 2022-02-01 | Paper |
The strong circular law: A combinatorial view
Random Matrices: Theory and Applications | 2021-12-27 | Paper |
Anticoncentration versus the Number of Subset Sums
Advances in Combinatorics | 2021-11-05 | Paper |
| Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities | 2021-11-05 | Paper |
Quantitative invertibility of random matrices: a combinatorial perspective
discrete Analysis | 2021-09-20 | Paper |
Universality and least singular values of random matrix products: a simplified approach
Bernoulli | 2021-09-10 | Paper |
Circular law for random block band matrices with genuinely sublinear bandwidth
Journal of Mathematical Physics | 2021-09-06 | Paper |
On the counting problem in inverse Littlewood-Offord theory
Journal of the London Mathematical Society | 2021-08-13 | Paper |
A note on the universality of ESDs of inhomogeneous random matrices
(available as arXiv preprint) | 2021-08-06 | Paper |
| A note on the universality of ESDs of inhomogeneous random matrices | 2021-08-06 | Paper |
Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
Israel Journal of Mathematics | 2021-07-12 | Paper |
| Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models | 2021-06-08 | Paper |
Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics
(available as arXiv preprint) | 2021-05-03 | Paper |
| On the sampling Lov\'asz Local Lemma for atomic constraint satisfaction problems | 2021-02-16 | Paper |
Number of 1-factorizations of regular high-degree graphs
Combinatorica | 2021-01-25 | Paper |
Anticoncentration versus the number of subset sums
(available as arXiv preprint) | 2021-01-19 | Paper |
1‐Factorizations of pseudorandom graphs
Random Structures & Algorithms | 2020-11-30 | Paper |
| Towards the sampling Lov\'asz Local Lemma | 2020-11-24 | Paper |
| Sharp invertibility of random Bernoulli matrices | 2020-10-13 | Paper |
The smallest singular value of dense random regular digraphs
(available as arXiv preprint) | 2020-08-11 | Paper |
Towards the linear arboricity conjecture
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Fast and memory-optimal dimension reduction using Kac's walk
(available as arXiv preprint) | 2020-03-22 | Paper |
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-30 | Paper |
| The probability of selecting k edge-disjoint Hamilton cycles in the complete graph | 2020-01-04 | Paper |
Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
Forum of Mathematics, Sigma | 2019-09-24 | Paper |
| Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs | 2019-03-28 | Paper |
On the \(k\)-planar local crossing number
Discrete Mathematics | 2019-02-20 | Paper |
| The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity | 2018-02-16 | Paper |
| The Vertex Sample Complexity of Free Energy is Polynomial | 2018-02-16 | Paper |
| A Counterexample to the "Majority is Least Stable" Conjecture | 2017-03-22 | Paper |
On discontinuity of planar optimal transport maps
Journal of Topology and Analysis | 2015-05-29 | Paper |
