DOI10.1214/13-AOP888zbMath1311.60117arXiv1203.2602MaRDI QIDQ471149
Allan Sly, Nike Sun
Publication date: 14 November 2014
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2602
Spatial mixing and the connective constant: optimal bounds,
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree,
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction,
Universality of the mean-field for the Potts model,
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs,
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs,
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms,
Algorithmic Pirogov-Sinai theory,
Computational implications of reducing data to sufficient statistics,
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures,
Perfect sampling from spatial mixing,
What can be sampled locally?,
Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \),
Fluctuations in mean-field Ising models,
Inapproximability of counting independent sets in linear hypergraphs,
Exact distributed sampling,
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs,
Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial,
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models,
Random cluster model on regular graphs,
Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019,
Inapproximability of the Independent Set Polynomial in the Complex Plane,
The replica symmetric solution for Potts models on \(d\)-regular graphs,
Counting Constraint Satisfaction Problems.,
Statistical Matching Theory,
The Ising partition function: zeros and deterministic approximation,
Approximation via Correlation Decay When Strong Spatial Mixing Fails,
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model,
Bethe states of random factor graphs,
Algorithms for #BIS-Hard Problems on Expander Graphs,
Counting hypergraph matchings up to uniqueness threshold,
Uniqueness for the 3-state antiferromagnetic Potts model on the tree,
Mixing of Markov chains for independent sets on chordal graphs with bounded separators,
Unnamed Item,
Unnamed Item,
On a conjecture of Sokal concerning roots of the independence polynomial,
Fisher zeros and correlation decay in the Ising model,
Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems,
Fisher Zeros and Correlation Decay in the Ising Model,
Exact recovery in the Ising blockmodel,
More on zeros and approximation of the Ising partition function,
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model,
Gauges, loops, and polynomials for partition functions of graphical models,
Implementations and the independent set polynomial below the Shearer threshold,
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
