Statistical Mechanics: Algorithms and Computations

By Werner Krauth. 2006

271 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/c8fda6b92288643d720efe43fcd5840c4d2a4260

Citations in the corpus

• Continuous-time Monte Carlo methods for quantum impurity models (2010, unknown): “For reader unfamiliar with Monte Carlo, the books by Landau and Binder (2000) and Krauth (2006) give an extensive introduction to the technique.”
• Accelerated Monte Carlo simulations with restricted Boltzmann machines (2016, unknown): “Monte Carlo method is one of the most flexible and powerful methods for studying many-body systems [1, 2].”
• DeepBach: a Steerable Model for Bach Chorales Generation (2016, unknown): “It is also possible to use the hard-disk-configurations generation algorithm (Alg.2.9 in (Krauth, 2006)) to appropriately choose all the time indexes at which we parallelly resample so that: • every time index is at distance at least δ from the other time indexes • configurations of time indexes…”
• Mean-field theory of hard sphere glasses and jamming (2008, unknown): “ms to simulate hard spheres have been invented. Smarter algorithms can be designed, that are able to sample the equilibrium measureat higher density (Dress and Krauth, 1995; Grigera and Parisi, 2001; Krauth, 2006). B. The “equilibrium” phase diagram The equilibrium phase diagram of hard spheres in R”
• Quantum speedup of Monte Carlo methods (2015, unknown): “We demonstrate that this known quadratic reduction can be combined with our algorithm to speed up the fastest known general-purpose classical algorithm with rigorous performance bounds [4] for approximately computing partition functions up to small relative error, a fundamental problem in statistica”