| Publication | Date of Publication | Type |
|---|
Optimal mixing for randomly sampling edge colorings on trees down to the max degree
SIAM Journal on Discrete Mathematics | 2026-09-08 | Paper |
Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
SIAM Journal on Computing | 2026-09-02 | Paper |
| A non-Markovian coupling for randomly sampling colorings | 2026-05-29 | Paper |
| Randomly coloring constant degree graphs | 2026-05-29 | Paper |
| Improved bounds for sampling colorings | 2026-05-06 | Paper |
| Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics | 2026-05-06 | Paper |
Optimal mixing via tensorization for random independent sets on arbitrary trees
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| Spectral independence via stability and applications to Holant-type problems | 2025-08-13 | Paper |
| The complexity of approximating averages on bounded-degree graphs | 2025-08-12 | Paper |
| Rapid mixing of Glauber dynamics up to uniqueness via contraction | 2025-08-12 | Paper |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model | 2025-08-06 | Paper |
Complexity of high-dimensional identity testing with coordinate conditional sampling
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Optimal mixing via tensorization for random independent sets on arbitrary trees | 2025-01-14 | Paper |
| Counting and sampling labeled chordal graphs in polynomial time | 2025-01-06 | Paper |
Spectral independence via stability and applications to Holant-type problems
TheoretiCS | 2024-08-13 | Paper |
| Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region | 2024-07-19 | Paper |
| On mixing of Markov chains: coupling, spectral independence, and entropy factorization | 2024-07-19 | Paper |
| Metastability of the Potts ferromagnet on random regular graphs | 2024-06-24 | Paper |
| Approximating observables is as hard as counting | 2024-06-24 | Paper |
scientific article; zbMATH DE number 7788432 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| The Swendsen-Wang Dynamics on Trees | 2023-11-20 | Paper |
Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Entropy decay in the Swendsen–Wang dynamics on ℤ<sup><i>d</i></sup>
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
The Swendsen–Wang dynamics on trees
Random Structures & Algorithms | 2023-10-23 | Paper |
| Lecture Notes on Spectral Independence and Bases of a Matroid: Local-to-Global and Trickle-Down from a Markov Chain Perspective | 2023-07-25 | Paper |
Metastability of the Potts ferromagnet on random regular graphs
Communications in Mathematical Physics | 2023-06-23 | Paper |
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
SIAM Journal on Computing | 2023-04-04 | Paper |
scientific article; zbMATH DE number 7650115 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650134 (Why is no real title available?) | 2023-02-03 | Paper |
On mixing of Markov chains: coupling, spectral independence, and entropy factorization
Electronic Journal of Probability | 2022-12-08 | Paper |
| Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling | 2022-07-19 | Paper |
Entropy decay in the Swendsen-Wang dynamics on \(\mathbb{Z}^d\)
The Annals of Applied Probability | 2022-05-06 | Paper |
Hardness of identity testing for restricted Boltzmann machines and Potts models
(available as arXiv preprint) | 2021-10-27 | Paper |
| Hardness of identity testing for restricted Boltzmann machines and Potts models | 2021-10-27 | Paper |
Swendsen-Wang dynamics for general graphs in the tree uniqueness region
(available as arXiv preprint) | 2021-08-04 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
| Spectral Independence via Stability and Applications to Holant-Type Problems | 2021-06-07 | Paper |
| Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region | 2021-05-04 | Paper |
Structure learning of \(H\)-colorings
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Random walks on small world networks
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
(available as arXiv preprint) | 2020-10-05 | Paper |
| Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models | 2020-10-05 | Paper |
Swendsen-Wang dynamics for general graphs in the tree uniqueness region
Random Structures & Algorithms | 2020-06-19 | Paper |
Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
The Annals of Applied Probability | 2020-05-13 | Paper |
Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
The Annals of Applied Probability | 2020-05-13 | Paper |
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
(available as arXiv preprint) | 2020-04-22 | Paper |
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
On counting perfect matchings in general graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
Spatial mixing and nonlocal Markov chains
Random Structures & Algorithms | 2019-11-28 | Paper |
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
SIAM Journal on Computing | 2019-05-07 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
Random Structures & Algorithms | 2019-02-20 | Paper |
Structure Learning of H-colorings
(available as arXiv preprint) | 2019-02-06 | Paper |
| Structure Learning of H-colorings | 2019-02-06 | Paper |
Fast algorithms at low temperatures via Markov chains
(available as arXiv preprint) | 2019-01-20 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
Journal of the ACM | 2018-08-02 | Paper |
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region
(available as arXiv preprint) | 2018-06-12 | Paper |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
(available as arXiv preprint) | 2018-04-22 | Paper |
Sampling random colorings of sparse random graphs
(available as arXiv preprint) | 2018-03-15 | Paper |
| Sampling random colorings of sparse random graphs | 2018-03-15 | Paper |
Spatial mixing and non-local Markov chains
(available as arXiv preprint) | 2018-03-15 | Paper |
| Spatial mixing and non-local Markov chains | 2018-03-15 | Paper |
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| Phase transition for Glauber dynamics for independent sets on regular trees | 2017-09-29 | Paper |
Swendsen-Wang algorithm on the mean-field Potts model
(available as arXiv preprint) | 2017-08-31 | Paper |
| \#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2017-03-22 | Paper |
Ferromagnetic Potts model: refined \#BIS-hardness and related results
(available as arXiv preprint) | 2017-03-22 | Paper |
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
SIAM Journal on Computing | 2016-12-13 | Paper |
| Spatial Mixing and Systematic Scan Markov chains | 2016-12-05 | Paper |
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Randomly coloring planar graphs with fewer colors than the maximum degree
Random Structures & Algorithms | 2016-01-07 | Paper |
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM | 2015-11-11 | Paper |
Improved bounds on the phase transition for the hard-core model in 2 dimensions
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
| Variable length path coupling | 2015-08-03 | Paper |
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Coupling with the stationary distribution and improved sampling for colorings and independent sets | 2014-10-13 | Paper |
Phase transition for Glauber dynamics for independent sets on regular trees
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Random Structures & Algorithms | 2014-08-25 | Paper |
An FPTAS for #Knapsack and Related Counting Problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Improved mixing condition on the grid for counting and sampling independent sets
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| scientific article; zbMATH DE number 6297817 (Why is no real title available?) | 2014-05-22 | Paper |
Randomly coloring constant degree graphs
Random Structures & Algorithms | 2013-10-09 | Paper |
Improved bounds on the phase transition for the hard-core model in 2-dimensions
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Improved mixing condition on the grid for counting and sampling independent sets
Probability Theory and Related Fields | 2013-06-19 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Algorithmica | 2013-04-03 | Paper |
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
The Annals of Applied Probability | 2013-01-25 | Paper |
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
The Annals of Applied Probability | 2013-01-25 | Paper |
A deterministic polynomial-time approximation scheme for counting knapsack solutions
SIAM Journal on Computing | 2012-08-10 | Paper |
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Reconstruction for Colorings on Trees
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Improved inapproximability results for counting independent sets in the hard-core model
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
Journal of the ACM | 2011-02-01 | Paper |
Accelerating simulated annealing for the permanent and combinatorial counting problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Sampling binary contingency tables with a greedy start
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Randomly coloring planar graphs with fewer colors than the maximum degree | 2009-01-05 | Paper |
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
SIAM Journal on Computing | 2008-10-28 | Paper |
Random Bichromatic Matchings
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Random bichromatic matchings
Algorithmica | 2008-04-23 | Paper |
Negative examples for sequential importance sampling of binary contingency tables
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Analysis of top-swap shuffling for genome rearrangements
The Annals of Applied Probability | 2008-01-28 | Paper |
Variable length path coupling
Random Structures & Algorithms | 2008-01-08 | Paper |
Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny
The Annals of Applied Probability | 2007-08-06 | Paper |
| A survey on the use of Markov chains to randomly sample colourings | 2007-06-28 | Paper |
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms | 2007-02-07 | Paper |
Sampling binary contingency tables with a greedy start
Random Structures & Algorithms | 2007-02-07 | Paper |
Coupling with the stationary distribution and improved sampling for colorings and independent sets
The Annals of Applied Probability | 2007-02-05 | Paper |
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
Journal of Discrete Algorithms | 2005-05-04 | Paper |
