Algorithmic Pirogov-Sinai theory (Q2174663): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 00:35, 27 July 2024

scientific article

Language	Label	Description	Also known as
English	Algorithmic Pirogov-Sinai theory	scientific article

Statements

scholarly article

0 references

Algorithmic Pirogov-Sinai theory (English)

0 references

zbMATH Open document ID

0 references

10.1007/s00440-019-00928-y

0 references

0 references

0 references

0 references

Probability Theory and Related Fields

0 references

publication date

21 April 2020

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

approximate sampling

0 references

approximation algorithms

0 references

FPTAS

0 references

discrete spin systems

0 references

Pirogov-Sinai theory

0 references

cluster expansion

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00440-019-00928-y

0 references

0 references

Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region

0 references

Computing the partition function for cliques in a graph

0 references

Computing the permanent of (some) complex matrices

0 references

Combinatorics and complexity of partition functions

0 references

Weighted counting of solutions to sparse systems of equations

0 references

Computing the partition function for graph homomorphisms with multiplicities

0 references

Constant Time Generation of Rooted Trees

0 references

Inapproximability of the independent set polynomial in the complex plane

0 references

Phase Coexistence for the Hard-Core Model on ℤ<sup>2</sup>

0 references

Random-cluster dynamics in \(\mathbb {Z}^2\)

0 references

Left and right convergence of graphs with bounded degree

0 references

0 references

Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point

0 references

A unified approach to phase diagrams in field theory and statistical mechanics

0 references

\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region

0 references

0 references

The relative complexity of approximate counting problems

0 references

Cluster expansion for abstract polymer models. New bounds from an old approach

0 references

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

0 references

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results

0 references

On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$

0 references

Sequential cavity method for computing free energy and surface pressure

0 references

Mixing Times of Critical Two‐Dimensional Potts Models

0 references

Approximating the Partition Function of the Ferromagnetic Potts Model

0 references

The Random-Cluster Model

0 references

Random cluster dynamics for the Ising model is rapidly mixing

0 references

Computing the Independence Polynomial: from the Tree Threshold down to the Roots

0 references

Algorithms for #BIS-hard problems on expander graphs

0 references

Polynomial-Time Approximation Algorithms for the Ising Model

0 references

Random generation of combinatorial structures from a uniform distribution

0 references

On the hard-hexagon model and the theory of modular functions

0 references

Cluster expansion for abstract polymer models

0 references

Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation

0 references

Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model

0 references

FPTAS for #BIS with Degree Bounds on One Side

0 references

The Ising partition function: zeros and deterministic approximation

0 references

Quasi-polynomial mixing of the 2D stochastic Ising model with ``plus'' boundary up to criticality

0 references

The number of trees

0 references

Computing the number of induced copies of a fixed graph in a bounded degree graph

0 references

Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials

0 references

Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)

0 references

On a conjecture of Sokal concerning roots of the independence polynomial

0 references

Slow mixing of glauber dynamics via topological obstructions

0 references

0 references

The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma

0 references

On a problem of Spencer

0 references

Approximate counting, uniform generation and rapidly mixing Markov chains

0 references

Counting in two-spin models on \(d\)-regular graphs

0 references

Boundary-connectivity via graph theory

0 references

Modular properties of the hard hexagon model.

0 references

Rapid mixing of Swendsen–Wang dynamics in two dimensions

0 references

Counting independent sets up to the tree threshold

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2174663

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2174663&oldid=36728224"