Image de couverture de livre

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bencs, Ferenc, Berrekkal, Khallil, Regts, Guus
Format:	Preprint
Publié:	2023
Sujets:	Probability Discrete Mathematics Mathematical Physics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Barvinok's interpolation method meets Weitz's correlation decay approach
par: Bencs, Ferenc, et autres
Publié: (2025)

Approximating the volume of a truncated relaxation of the independence polytope
par: Bencs, Ferenc, et autres
Publié: (2024)

A near-optimal zero-free disk for the Ising model
par: Patel, Viresh, et autres
Publié: (2023)

On zeros and algorithms for disordered systems: mean-field spin glasses
par: Bencs, Ferenc, et autres
Publié: (2025)

On the complex zeros and the computational complexity of approximating the reliability polynomial
par: Bencs, Ferenc, et autres
Publié: (2025)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)

Decay of correlations and zeros for the hard-core model
par: Peters, Han, et autres
Publié: (2026)

Cutoff profile of the Metropolis biased card shuffling
par: Zhang, Lingfu
Publié: (2022)

A lower bound on the spectrum of unimodular networks
par: Rahman, Mustazee
Publié: (2016)

Speeding up random walk mixing by starting from a uniform vertex
par: Díaz, Alberto Espuny, et autres
Publié: (2022)

Rapid mixing of the flip chain over non-crossing spanning trees
par: Anand, Konrad, et autres
Publié: (2024)

Decoupling of clusters in independent sets in a percolated hypercube
par: Chowdhury, Mriganka Basu Roy, et autres
Publié: (2025)

Gaussian to log-normal transition for independent sets in a percolated hypercube
par: Chowdhury, Mriganka Basu Roy, et autres
Publié: (2024)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
par: Gurvits, Leonid, et autres
Publié: (2023)

Zero-One Laws for Random Feasibility Problems
par: Altschuler, Dylan J.
Publié: (2023)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
par: Gamarnik, David, et autres
Publié: (2023)

A binomial random multigraph
par: Pelekis, Christos
Publié: (2023)

Canonical labelling of random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2026)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
par: Chinyaev, Boris
Publié: (2025)

A threshold for online balancing of sparse i.i.d. vectors
par: Altschuler, Dylan J., et autres
Publié: (2025)

Limit Laws for Critical Dispersion on Complete Graphs
par: De Ambroggio, Umberto, et autres
Publié: (2024)

Shotgun assembly of random graphs
par: Johnston, Tom, et autres
Publié: (2022)

Infinite Schnyder Woods
par: Addario-Berry, Louigi, et autres
Publié: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
par: Li, Ray, et autres
Publié: (2025)

Approximate polymorphisms of predicates
par: Alekseev, Yaroslav, et autres
Publié: (2025)

Record-biased permutations and their permuton limit
par: Bouvel, Mathilde, et autres
Publié: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
par: Fang, Xuan, et autres
Publié: (2025)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
par: Pham, Huy Tuan
Publié: (2024)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
par: Tiskin, Alexander
Publié: (2022)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Sunflowers in set systems with small VC-dimension
par: Balogh, József, et autres
Publié: (2024)

Minimum stationary values of sparse random directed graphs
par: Cai, Xing Shi, et autres
Publié: (2020)

Spread blow-up lemma with an application to perturbed random graphs
par: Nenadov, Rajko, et autres
Publié: (2024)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
par: Gajjala, Rishikesh
Publié: (2026)

Random 0/1-polytopes expand rapidly
par: Guo, He, et autres
Publié: (2026)

Recoverable systems and the maximal hard-core model on the triangular lattice
par: Wang, Geyang, et autres
Publié: (2026)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)