Canonical Paths for MCMC: from Art to Science

DOI10.1137/1.9781611974331.ch38zbMath1411.68193arXiv1510.04099OpenAlexW2949326365MaRDI QIDQ4575615

Lingxiao Huang, Chihao Zhang, Pinyan Lu

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (8)

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Counting vertices of integral polytopes defined by facets ⋮ Approximability of the complementarily symmetric Holant problems on cubic graphs ⋮ Unnamed Item ⋮ Beyond windability: approximability of the four-vertex model ⋮ On the Complexity of Holant Problems ⋮ Some applications of Wagner's weighted subgraph counting polynomial

This page was built for publication: Canonical Paths for MCMC: from Art to Science