Polynomial-Time Approximation Algorithms for the Ising Model
From MaRDI portal
ferromagnetic Ising systemIsing modelIsing spin configurationsMarkov chainMonte Carlo simulationpartition functionpolynomial-time approximation algorithmsrapid mixing
Graph algorithms (graph-theoretic aspects) (05C85) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)
Recommendations
- scientific article; zbMATH DE number 177833
- scientific article; zbMATH DE number 1305519
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Stratified sampling for the Ising model: A graph-theoretic approach
- The Ising partition function: zeros and deterministic approximation
Cited in
(only showing first 100 items - show all)- Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
- Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
- On the hardness of sampling independent sets beyond the tree threshold
- On the two-dimensional stochastic Ising model in the phase coexistence region near the critical point
- Approximability of the ground state problem for certain Ising spin glasses
- Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
- Approximating the number of monomer-dimer coverings of a lattice.
- Random cluster dynamics for the Ising model is rapidly mixing
- Sampling weighted perfect matchings on the square-octagon lattice
- Total variation discrepancy of deterministic random walks for ergodic Markov chains
- The complexity of approximating complex-valued Ising and Tutte partition functions
- Complexity classification of the six-vertex model
- The Ising partition function: zeros and deterministic approximation
- Glauber dynamics on trees and hyperbolic graphs
- A new approach to solving three combinatorial enumeration problems on planar graphs
- On the two-dimensional dynamical Ising model in the phase coexistence region
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure
- Hitting time of quantum walks with perturbation
- Approximating partition functions of the two-state spin system
- The computational complexity of generating random fractals
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems
- The complexity of approximating the complex-valued Potts model
- Zero-freeness and approximation of real Boolean Holant problems
- Zeros and approximations of holant polynomials on the complex plane
- Algorithmic Pirogov-Sinai theory
- Cluster analysis of spatial point patterns: posterior distribution of parents inferred from offspring
- Simulation reductions for the Ising model
- Approximation algorithms for the normalizing constant of Gibbs distributions
- Functional clones and expressibility of partition functions
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Universality of the mean-field for the Potts model
- Stein's method for concentration inequalities
- Randomized scheduling algorithm for queueing networks
- Estimation in spin glasses: a first step
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- A new genetic algorithm
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
- The Potts model and the Tutte polynomial.
- Analyzing Glauber dynamics by comparison of Markov chains
- Quantum walks on necklaces and mixing
- A graph polynomial for independent sets of bipartite graphs
- Complexity of Ising polynomials
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- Inverse sampling for nonasymptotic sequential estimation of bounded variable means
- The complexity of approximately counting tree homomorphisms
- A complexity classification of spin systems with an external field
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- Some problems on approximate counting in graphs and matroids
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
- Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- The computational complexity of estimating MCMC convergence time
- Stratified sampling for the Ising model: A graph-theoretic approach
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- Spectral bounds for the Ising ferromagnet on an arbitrary given graph
- Algorithms for \#BIS-hard problems on expander graphs
- Low depth quantum circuits for Ising models
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- scientific article; zbMATH DE number 177833 (Why is no real title available?)
- Sparse reliable graph backbones
- Simulation reduction of the Ising model to general matchings
- Combinatorial bandits
- Critical Ising on the square lattice mixes in polynomial time
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Approximation via Correlation Decay When Strong Spatial Mixing Fails
- scientific article; zbMATH DE number 1563189 (Why is no real title available?)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- More on zeros and approximation of the Ising partition function
- On the Complexity of Holant Problems
- Counting constraint satisfaction problems
- Glauber dynamics for Ising model on convergent dense graph sequences
- scientific article; zbMATH DE number 7375995 (Why is no real title available?)
- Counting problems in parameterized complexity
- Swendsen-Wang dynamics for general graphs in the tree uniqueness region
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- The worm process for the Ising model is rapidly mixing
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- The complexity of approximating the complex-valued Potts model
- Classical restrictions of generic matrix product states are quasi-locally Gibbsian
- Hardness of identity testing for restricted Boltzmann machines and Potts models
- Approximately counting paths and cycles in a graph
- Cycle basis Markov chains for the Ising model
- Approximating pairwise correlations in the Ising model
- An accelerated exhaustive enumeration algorithm in the Ising model
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
- Counting hypergraph colorings in the local lemma regime
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Perfect Simulation for Image Restoration
- An upper bound on the convergence time of the Gibbs sampler in Ising models
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- NEW ALGORITHM FOR THE COMPUTATION OF THE PARTITION FUNCTION FOR THE ISING MODEL ON A SQUARE LATTICE
- Approximate counting via correlation decay in spin systems
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
This page was built for publication: Polynomial-Time Approximation Algorithms for the Ising Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142597)
