| Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region | 0 | 0.34 | 2022 |
| On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization | 0 | 0.34 | 2022 |
| Approximating Observables Is as Hard as Counting | 0 | 0.34 | 2022 |
| Metastability of the Potts Ferromagnet on Random Regular Graphs | 0 | 0.34 | 2022 |
| Entropy decay in the Swendsen–Wang dynamics on ℤd | 0 | 0.34 | 2021 |
| The Swendsen-Wang Dynamics on Trees. | 0 | 0.34 | 2021 |
| Spectral Independence via Stability and Applications to Holant-Type Problems | 0 | 0.34 | 2021 |
| Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion | 1 | 0.36 | 2021 |
| Rapid Mixing for Colorings via Spectral Independence | 0 | 0.34 | 2021 |
| Hardness Of Identity Testing For Restricted Boltzmann Machines And Potts Models | 0 | 0.34 | 2020 |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs | 1 | 0.36 | 2020 |
| Structure Learning of H-Colorings | 0 | 0.34 | 2020 |
| Swendsen‐Wang dynamics for general graphs in the tree uniqueness region | 0 | 0.34 | 2020 |
| Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. | 0 | 0.34 | 2019 |
| Random-Cluster Dynamics in Z2 - Rapid Mixing with General Boundary Conditions. | 0 | 0.34 | 2019 |
| Improved Strong Spatial Mixing for Colorings on Trees. | 0 | 0.34 | 2019 |
| Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. | 0 | 0.34 | 2019 |
| Fast Algorithms at Low Temperatures via Markov Chains. | 0 | 0.34 | 2019 |
| Structure Learning of ${H}$-colorings. | 0 | 0.34 | 2018 |
| Spatial Mixing and Non-local Markov chains. | 1 | 0.36 | 2018 |
| On Counting Perfect Matchings in General Graphs. | 0 | 0.34 | 2018 |
| Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. | 0 | 0.34 | 2018 |
| Sampling Random Colorings of Sparse Random Graphs. | 2 | 0.38 | 2018 |
| Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. | 1 | 0.36 | 2018 |
| Random Walks on Small World Networks | 0 | 0.34 | 2017 |
| Spatial Mixing and Systematic Scan Markov chains. | 0 | 0.34 | 2016 |
| #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. | 1 | 0.37 | 2016 |
| Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model | 9 | 0.55 | 2016 |
| Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. | 6 | 0.50 | 2015 |
| Swendsen-Wang Algorithm on the Mean-Field Potts Model. | 2 | 0.42 | 2015 |
| Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. | 1 | 0.36 | 2014 |
| BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. | 0 | 0.34 | 2013 |
| Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region | 8 | 0.48 | 2013 |
| Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. | 2 | 0.38 | 2013 |
| Negative examples for sequential importance sampling of binary contingency tables | 16 | 1.72 | 2012 |
| Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models | 28 | 0.98 | 2012 |
| A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions | 13 | 0.72 | 2012 |
| Reconstruction for Colorings on Trees. | 10 | 0.63 | 2011 |
| Improved inapproximability results for counting independent sets in the hard-core model. | 16 | 0.92 | 2011 |
| Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. | 2 | 0.50 | 2011 |
| Phase transition for the mixing time of the Glauber dynamics for coloring regular trees | 4 | 0.42 | 2010 |
| Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species | 1 | 0.43 | 2010 |
| Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. | 2 | 0.40 | 2010 |
| Adaptive simulated annealing: A near-optimal connection between sampling and counting | 26 | 1.67 | 2009 |
| Random Bichromatic Matchings | 0 | 0.34 | 2008 |
| Mutations Of Different Molecular Origins Exhibit Contrasting Patterns Of Regional Substitution Rate Variation | 5 | 1.24 | 2008 |
| Accelerating simulated annealing for the permanent and combinatorial counting problems | 16 | 1.34 | 2008 |
| Variable length path coupling | 8 | 0.64 | 2007 |
| Randomly coloring planar graphs with fewer colors than the maximum degree | 7 | 0.57 | 2007 |
| Phylogeny of mixture models: robustness of maximum likelihood and non-identifiable distributions. | 7 | 0.98 | 2007 |
