Approximation algorithms for the normalizing constant of Gibbs distributions
From MaRDI portal
Publication:2341636
DOI10.1214/14-AAP1015zbMath1328.65011arXiv1206.2689OpenAlexW2071516900MaRDI QIDQ2341636
Publication date: 27 April 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.2689
Related Items
Fast algorithms at low temperatures via Markov chains†, Unnamed Item, Robust Estimation of the Mean with Bounded Relative Standard Deviation, Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model, Normalizing constants of log-concave densities, Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes, Approximately counting bases of bicircular matroids
Cites Work
- Perfect simulation of Vervaat perpetuities
- Perfect sampling using bounding chains.
- Choosing sample path length and number of sample paths when starting in steady state
- Polynomial-Time Approximation Algorithms for the Ising Model
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Handbook of Markov Chain Monte Carlo
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Unnamed Item
- Unnamed Item