| Publication | Date of Publication | Type |
|---|
On the chromatic number of random triangle-free graphs
Random Structures & Algorithms | 2026-07-20 | Paper |
Pirogov-Sinai theory for the hard-core model beyond lattices
Communications in Mathematical Physics | 2026-05-15 | Paper |
| Approximately counting independent sets of a given size in bounded-degree graphs | 2026-05-12 | Paper |
Fast and slow mixing of the Kawasaki dynamics on bounded-degree graphs
Random Structures & Algorithms | 2025-11-25 | Paper |
On the evolution of structure in triangle-free graphs
Advances in Mathematics | 2025-10-14 | Paper |
| Fast and slow mixing of the Kawasaki dynamics on bounded-degree graphs | 2025-10-06 | Paper |
| Algorithms and barriers in the symmetric binary perceptron model | 2025-08-15 | Paper |
| Hardness of finding independent sets in almost 3-colorable graphs | 2025-04-29 | Paper |
Fast and perfect sampling of subgraphs and polymer systems
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Perfect sampling for hard spheres from strong spatial mixing | 2025-01-14 | Paper |
Potential-weighted connective constants and uniqueness of Gibbs measures
Communications in Mathematical Physics | 2025-01-14 | Paper |
Searching for (sharp) thresholds in random structures: where are we now?
Bulletin of the American Mathematical Society. New Series | 2025-01-08 | Paper |
| On the hardness of finding balanced independent sets in random bipartite graphs | 2024-11-28 | Paper |
On the zeroes of hypergraph independence polynomials
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
| Fast and perfect sampling of subgraphs and polymer systems | 2024-08-22 | Paper |
| Approximately counting independent sets in bipartite graphs via graph containers | 2024-07-19 | Paper |
Frozen 1-RSB structure of the symmetric Ising perceptron
Random Structures & Algorithms | 2024-05-17 | Paper |
| On the evolution of structure in triangle-free graphs | 2023-12-14 | Paper |
Computational thresholds for the fixed-magnetization Ising model
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 |
Frozen 1-RSB structure of the symmetric Ising perceptron
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximately counting independent sets in bipartite graphs via graph containers
Random Structures & Algorithms | 2023-10-12 | Paper |
Approximately counting independent sets in bipartite graphs via graph containers
Random Structures & Algorithms | 2023-10-12 | Paper |
Efficient sampling and counting algorithms for the Potts model on <i>ℤ</i><sup><i>d</i></sup> at all temperatures
Random Structures & Algorithms | 2023-10-12 | Paper |
| On the hardness of finding balanced independent sets in random bipartite graphs | 2023-07-25 | Paper |
| Percolation on hypergraphs and the hard-core model | 2023-07-19 | Paper |
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2023-06-21 | Paper |
| Perfect Sampling for Hard Spheres from Strong Spatial Mixing | 2023-05-03 | Paper |
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
SIAM Journal on Computing | 2023-04-28 | Paper |
Analyticity for classical gasses via recursion
Communications in Mathematical Physics | 2023-04-06 | Paper |
Independent sets of a given size and structure in the hypercube
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Maximum entropy and integer partitions
Combinatorial Theory | 2023-03-31 | Paper |
| Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization | 2023-02-13 | Paper |
Storage capacity in symmetric binary perceptrons
Journal of Physics A: Mathematical and Theoretical | 2022-12-09 | Paper |
| On the zeroes of hypergraph independence polynomials | 2022-11-01 | Paper |
Correlation decay for hard spheres via Markov chains
The Annals of Applied Probability | 2022-09-05 | Paper |
Strong spatial mixing for repulsive point processes
Journal of Statistical Physics | 2022-08-19 | Paper |
| Algorithms and Barriers in the Symmetric Binary Perceptron Model | 2022-03-29 | Paper |
On the number of independent sets in uniform, regular, linear hypergraphs
European Journal of Combinatorics | 2021-10-28 | Paper |
A proof of the upper matching conjecture for large graphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
| Potential-weighted connective constants and uniqueness of Gibbs measures | 2021-09-02 | Paper |
Approximately counting independent sets of a given size in bounded-degree graphs
(available as arXiv preprint) | 2021-02-09 | Paper |
Counting independent sets in unbalanced bipartite graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Independent sets in the hypercube revisited
Journal of the London Mathematical Society | 2020-12-22 | Paper |
Independent sets in the hypercube revisited
Journal of the London Mathematical Society | 2020-12-22 | Paper |
Algorithms for \#BIS-hard problems on expander graphs
SIAM Journal on Computing | 2020-08-03 | Paper |
Analyticity for classical gasses via recursion
(available as arXiv preprint) | 2020-08-03 | Paper |
Algorithmic Pirogov-Sinai theory
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2020-04-21 | Paper |
Algorithmic Pirogov-Sinai theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Spin systems on Bethe lattices
Communications in Mathematical Physics | 2019-11-26 | Paper |
Algorithms for #BIS-hard problems on expander graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Efficient sampling and counting algorithms for the Potts model on \mathbb Z^d at all temperatures
(available as arXiv preprint) | 2019-09-19 | Paper |
Bethe states of random factor graphs
Communications in Mathematical Physics | 2019-03-21 | Paper |
Fast algorithms at low temperatures via Markov chains
(available as arXiv preprint) | 2019-01-20 | Paper |
On the hard sphere model and sphere packings in high dimensions
Forum of Mathematics, Sigma | 2019-01-16 | Paper |
Counting independent sets in cubic graphs of given girth
Journal of Combinatorial Theory. Series B | 2018-10-11 | Paper |
Extremes of the internal energy of the Potts model on cubic graphs
Random Structures & Algorithms | 2018-09-28 | Paper |
Tight bounds on the coefficients of partition functions via stability
Journal of Combinatorial Theory. Series A | 2018-09-07 | Paper |
On kissing numbers and spherical codes in high dimensions
Advances in Mathematics | 2018-08-29 | Paper |
On kissing numbers and spherical codes in high dimensions
Advances in Mathematics | 2018-08-29 | Paper |
On the complexity of random satisfiability problems with planted solutions
SIAM Journal on Computing | 2018-07-17 | Paper |
Information-theoretic thresholds from the cavity method
Advances in Mathematics | 2018-07-05 | Paper |
Belief propagation on replica symmetric random factor graph models
Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) | 2018-06-28 | Paper |
Belief propagation on replica symmetric random factor graph models
(available as arXiv preprint) | 2018-04-19 | Paper |
Tight bounds on the coefficients of partition functions via stability
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Tight bounds on the coefficients of partition functions via stability
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
On the average size of independent sets in triangle-free graphs
Proceedings of the American Mathematical Society | 2017-11-21 | Paper |
On the Widom-Rowlinson occupancy fraction in regular graphs
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Independent sets, matchings, and occupancy fractions
Journal of the London Mathematical Society | 2017-09-14 | Paper |
Independent sets, matchings, and occupancy fractions
Journal of the London Mathematical Society | 2017-09-14 | Paper |
Limits of discrete distributions and Gibbs measures on random graphs
European Journal of Combinatorics | 2017-09-11 | Paper |
Information-theoretic thresholds from the cavity method
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
European Journal of Combinatorics | 2017-03-28 | Paper |
On sharp thresholds in random geometric graphs
(available as arXiv preprint) | 2017-03-22 | Paper |
Birthday inequalities, repulsion, and hard spheres
Proceedings of the American Mathematical Society | 2016-03-29 | Paper |
Birthday inequalities, repulsion, and hard spheres
Proceedings of the American Mathematical Society | 2016-03-29 | Paper |
Random k-SAT and the power of two choices
Random Structures & Algorithms | 2015-10-12 | Paper |
On the complexity of random satisfiability problems with planted solutions (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Large deviations for the empirical distribution in the branching random walk
Electronic Journal of Probability | 2015-08-07 | Paper |
Erratum to: ``The Bohman-Frieze process near criticality''
Random Structures & Algorithms | 2015-07-23 | Paper |
| Spectral Thresholds in the Bipartite Stochastic Block Model | 2015-06-22 | Paper |
| Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's | 2014-07-10 | Paper |
Some deficiencies of \(\chi^2\) and classical exact tests of significance
Applied and Computational Harmonic Analysis | 2014-05-26 | Paper |
The Bohman-Frieze process near criticality
Random Structures & Algorithms | 2013-10-09 | Paper |
The forgetfulness of balls and bins
Random Structures & Algorithms | 2013-03-12 | Paper |
Searching for (sharp) thresholds in random structures: where are we now?
(available as arXiv preprint) | N/A | Paper |
