Counting without sampling

DOI10.1145/1109557.1109655zbMath1192.82038arXivmath/0510471OpenAlexW4242813735MaRDI QIDQ3581598

Antar Bandyopadhyay, David Gamarnik

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Absence of zeros implies strong spatial mixing ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ Factor models on locally tree-like graphs ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Uniqueness thresholds on trees versus graphs ⋮ Endogeny for the logistic recursive distributional equation ⋮ Ising models on locally tree-like graphs ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ The number of matchings in random graphs ⋮ Unnamed Item

This page was built for publication: Counting without sampling