Efficient exact sampling from the Ising model using Swendsen-Wang

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient exact sampling from the Ising model using Swendsen-Wang

Full text

Pdf (237 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 921 - 922

Year of Publication: 1999

ISBN:0-89871-434-6

Author

Mark Huber

School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 26, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Colin Cooper and Alan Frieze. Mixing properties of the Swendsen-Wang process on classes of g'aphs. Preprint, 1998.
	2	C.M. Fortuin and P.W. Kasteleyn. On the random cluster model I: Introduction and relation to other models. Physic.a, 57:536-564, 1972.
	3	Olle H#iggstr0m and Karin Nelander. On exact simulation from Markov random fields using coupling from the past. Scand. J. Statist., 1997. To Appear.
	4	Mark Huber, Exact sampling and approximate counting techniques, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.31-40, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276709]
	5	James Gary Propp , David Bruce Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures & Algorithms, v.9 n.1-2, p.223-252, Aug./Sept. 1996
	6	R. Swendsen and .I-S. Wang. Non-universal critical dynamics in Monte Carlo simulation. Physical Review Lettem, 58:86- 88, 1987.

CITED BY 2

	Dana Randall , David Wilson, Sampling spin configurations of an Ising system, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.959-960, January 17-19, 1999, Baltimore, Maryland, United States
	Mark Huber, A bounding chain for Swendsen-Wang, Random Structures & Algorithms, v.22 n.1, p.43-59, January 2003

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

Additional Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Computations on discrete structures

G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS

General Terms:
Algorithms, Design, Theory

Collaborative Colleagues:

Mark Huber: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player