81 results on '"Vigoda, Eric"'
Search Results
2. On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
3. Rapid Mixing for Colorings via Spectral Independence
4. Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
5. Metastability of the Potts Ferromagnet on Random Regular Graphs
6. Sampling Random Colorings of Sparse Random Graphs
7. Spatial Mixing and Non-local Markov chains
8. On Counting Perfect Matchings in General Graphs
9. The Swendsen–Wang dynamics on trees
10. Entropy decay in the Swendsen–Wang dynamics on Zd
11. Spectral Independence via Stability and Applications to Holant-Type Problems
12. On mixing of Markov chains: coupling, spectral independence, and entropy factorization
13. Entropy decay in the Swendsen–Wang dynamics on ℤd
14. Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
15. Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
16. Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
17. Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
18. The complexity of approximating averages on bounded-degree graphs
19. Fast algorithms at low temperatures via Markov chains†
20. Structure Learning of H-Colorings
21. Random Walks on Small World Networks
22. A SURVEY ON THE USE OF MARKOV CHAINS TO RANDOMLY SAMPLE COLOURINGS
23. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
24. Random Bichromatic Matchings
25. Rapidly mixing Markov chains for dismantleable constraint graphs
26. Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
27. Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View
28. Random-cluster dynamics in $\mathbb{Z}^{2}$: Rapid mixing with general boundary conditions
29. Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
30. Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
31. Spatial mixing and nonlocal Markov chains
32. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
33. Swendsen‐Wang algorithm on the mean‐field Potts model
34. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
35. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
36. Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
37. Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
38. Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
39. Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions
40. Randomly coloring planar graphs with fewer colors than the maximum degree
41. Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region
42. Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees
43. Improved inapproximability results for counting independent sets in the hard-core model
44. Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
45. Randomly coloring constant degree graphs
46. Improved mixing condition on the grid for counting and sampling independent sets
47. A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
48. An FPTAS for #Knapsack and Related Counting Problems
49. Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets
50. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.