Polymer dynamics via cliques: new conditions for approximations

DOI10.1016/j.tcs.2022.11.035OpenAlexW4312082597MaRDI QIDQ2110377

Tobias Friedrich, Marcus Pappik, Martin S. Krejca, Andreas Göbel

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.08293

zbMATH Keywords

partition functionMarkov chainGibbs distributionapproximate countingabstract polymer model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the hardness of sampling independent sets beyond the tree threshold
• Cluster expansion for abstract polymer models
• Random generation of combinatorial structures from a uniform distribution
• NP is as easy as detecting unique solutions
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• Loss network representation of Peierls contours
• Zeros and approximations of holant polynomials on the complex plane
• On a conjecture of Sokal concerning roots of the independence polynomial
• Cluster expansion for abstract polymer models. New bounds from an old approach
• Counting independent sets up to the tree threshold
• Probability
• Left and right convergence of graphs with bounded degree
• On Markov Chains for Independent Sets
• Sampling biased monotonic surfaces using exponential metrics
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
• A Spectral Independence View on Hard Spheres via Block Dynamics
• Fast Algorithms for General Spin Systems on Bipartite Expanders
• Beitrag zur Theorie des Ferromagnetismus
• Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
• Counting independent sets in unbalanced bipartite graphs
• Algorithmic Pirogov-Sinai theory
• Algorithms for #BIS-hard problems on expander graphs
• Statistical Mechanics of Lattice Systems
• Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
• Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
• Independent sets of a given size and structure in the hypercube