Algorithms for hard-constraint point processes via discretization

DOI10.1007/978-3-031-22105-7_22arXiv2107.08848MaRDI QIDQ6113849

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

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

samplingpartition functionWidom-Rowlinson modelhard-sphere modeldeterministic and randomized approximation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• Self-avoiding walks and trees in spread-out lattices
• Strong spatial mixing for repulsive point processes
• Spatial mixing and the connective constant: optimal bounds
• Improved inapproximability results for counting independent sets in the hard-core model
• Counting independent sets up to the tree threshold
• Adaptive simulated annealing: A near-optimal connection between sampling and counting
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
• A Spectral Independence View on Hard Spheres via Block Dynamics
• Algorithmic Pirogov-Sinai theory
• Equation of State Calculations by Fast Computing Machines
• Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
• Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion

This page was built for publication: Algorithms for hard-constraint point processes via discretization