scientific article; zbMATH DE number 7415095
From MaRDI portal
Publication:5159424
Eric Vigoda, Daniel Štefanković, Antonio Blanca, Zongchen Chen
Publication date: 27 October 2021
Full work available at URL: https://arxiv.org/abs/2004.10805
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
- The worm process for the Ising model is rapidly mixing
- Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)
- Gibbs measures and phase transitions.
- Glauber dynamics for the mean-field Potts model
- The complexity of approximating conservative counting CSPs
- Computational implications of reducing data to sufficient statistics
- An approximation trichotomy for Boolean \#CSP
- Random generation of combinatorial structures from a uniform distribution
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
- The relative complexity of approximate counting problems
- The random-cluster model on the complete graph
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
- Efficiently Learning Ising Models on Arbitrary Graphs
- Polynomial-Time Approximation Algorithms for the Ising Model
- Training Products of Experts by Minimizing Contrastive Divergence
- The Complexity of Ferromagnetic Ising with Local Fields
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- The Complexity of Distinguishing Markov Random Fields
- Approximating the Partition Function of the Ferromagnetic Potts Model
- The Complexity of Enumeration and Reliability Problems
- Random cluster dynamics for the Ising model is rapidly mixing
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- Testing Ising Models
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Learning restricted Boltzmann machines via influence maximization
- Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
- Dynamics for the mean-field random-cluster model
- Swendsen-Wang Algorithm on the Mean-Field Potts Model
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- The expressibility of functions on the boolean domain, with applications to counting CSPs
- The phase transition in the cluster‐scaled model of a random graph
- A Fast Learning Algorithm for Deep Belief Nets
- The Random-Cluster Model
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
- Information Theory and Statistics: A Tutorial
This page was built for publication:
