Vishesh Jain

Clayton Mizgerd

Shyam Ravichandran

CoRR, May, 2026

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity.

[BibT_eX]

[DOI]

Clayton Mizgerd

Eric Vigoda

CoRR, April, 2026

Entropic independence via sparse localization.

[BibT_eX]

[DOI]

CoRR, April, 2026

2025

An explicit economical additive basis.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2025

2024

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Rapid Mixing of the Down-Up Walk on Matchings of a Fixed Size.

[BibT_eX]

[DOI]

Clayton Mizgerd

Proceedings of the Approximation, 2024

2023

Optimal Minimization of the Covariance Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Spencer's theorem in nearly input-sparsity time.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

On the smallest singular value of symmetric random matrices.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

On the number of Hadamard matrices via anti-concentration.

[BibT_eX]

[DOI]

Yufei Zhao

Comb. Probab. Comput., 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Approximate counting and sampling via local central limit theorems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Anticoncentration versus the number of subset sums.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Towards the sampling Lovász Local Lemma.

[BibT_eX]

[DOI]

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

2020

Towards the linear arboricity conjecture.

[BibT_eX]

[DOI]

Jacob Fox

J. Comb. Theory B, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

On the real Davies' conjecture.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Natesh S. Pillai

Aaron Smith

CoRR, 2020

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

[BibT_eX]

[DOI]

Benny Sudakov

Comb., 2020

2019

On the k-planar local crossing number.

[BibT_eX]

[DOI]

Discret. Math., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Andrej Risteski

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

Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

2018

1-Factorizations of Pseudorandom Graphs.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

The Vertex Sample Complexity of Free Energy is Polynomial.

[BibT_eX]

[DOI]

Elchanan Mossel

Proceedings of the Conference On Learning Theory, 2018

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

[BibT_eX]

[DOI]

Elchanan Mossel

Proceedings of the Conference On Learning Theory, 2018

2017

Approximating Partition Functions in Constant Time.

[BibT_eX]

[DOI]

Elchanan Mossel

CoRR, 2017

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

[BibT_eX]

[DOI]