scientific article; zbMATH DE number 7650115
From MaRDI portal
Publication:5875505
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.48MaRDI QIDQ5875505
Charilaos Efthymiou, Daniel Štefanković, Thomas P. Hayes, Andreas Galanis, Eric Vigoda
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1909.07059
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing, Absence of zeros implies strong spatial mixing, Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \)
Cites Work
- Unnamed Item
- Unnamed Item
- The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- Uniqueness of uniform random colorings of regular trees
- Uniqueness for the 3-state antiferromagnetic Potts model on the tree
- On a conjecture of Sokal concerning roots of the independence polynomial
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- Randomly coloring constant degree graphs
- Counting independent sets up to the tree threshold
- FPTAS for #BIS with Degree Bounds on One Side
- Randomly coloring graphs with lower bounds on girth and maximum degree
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Spatial Mixing and Non-local Markov chains
- Mixing in time and space for lattice spin systems: A combinatorial view
- Strong spatial mixing of list coloring of graphs
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs
- A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold
- Correlation Decay up to Uniqueness in Spin Systems
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
