Pages that link to "Item:Q2286792"

The following pages link to On a conjecture of Sokal concerning roots of the independence polynomial (Q2286792):

Displaying 29 items.

• On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
• Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
• Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
• Polymer dynamics via cliques: new conditions for approximations (Q2110377) (← links)
• The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
• Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
• Algorithmic Pirogov-Sinai theory (Q2174663) (← links)
• Cayley trees do not determine the maximal zero-free locus of the independence polynomial (Q2238459) (← links)
• Computing permanents of complex diagonally dominant matrices and tensors (Q2317703) (← links)
• The interaction light cone of the discrete Bak-Sneppen, contact and other local processes (Q2328713) (← links)
• Analyticity for classical gasses via recursion (Q2696104) (← links)
• Location of zeros for the partition function of the Ising model on bounded degree graphs (Q3296755) (← links)
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
• Lee-Yang zeros of the antiferromagnetic Ising model (Q5081587) (← links)
• The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
• (Q5090447) (← links)
• (Q5091171) (← links)
• Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
• Fisher zeros and correlation decay in the Ising model (Q5205182) (← links)
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
• (Q5875505) (← links)
• Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction (Q5885600) (← links)
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
• Absence of zeros implies strong spatial mixing (Q6045833) (← links)
• Correlation decay and the absence of zeros property of partition functions (Q6077053) (← links)
• Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
• Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial (Q6198132) (← links)