Krauth 2002
From Werner KRAUTH
(Difference between revisions)
| Revision as of 09:07, 27 October 2012 Werner (Talk | contribs) ← Previous diff |
Revision as of 17:10, 10 August 2016 Werner (Talk | contribs) Next diff → |
||
| Line 1: | Line 1: | ||
| - | in construction | + | '''W. Krauth''' '''''Disks on a Sphere and two-dimensional Glasses''''' '''arXiv:cond-mat/0209391 (2002)''' |
| + | |||
| + | =Paper= | ||
| + | |||
| + | '''Abstract''' | ||
| + | I describe the classic circle-packing problem on a sphere, and the analytic and numerical approaches that have been used to study it. I then present a very simple Markov-chain Monte Carlo algorithm, which succeeds in finding the best solutions known today. The behavior of the algorithm is put into the context of the statistical physics of glasses. | ||
| + | |||
| + | [http://arxiv.org/abs/cond-mat/0209391 Electronic version (from arXiv)] | ||
| + | |||
| + | =Context= | ||
| + | |||
| + | The material in this paper is taken up in Section 7.1 of my 2006 book "Statistical Mechanics: Algorithms and Computations". | ||
| + | |||
| + | =Python implementation= | ||
| + | Under construction | ||
Revision as of 17:10, 10 August 2016
W. Krauth Disks on a Sphere and two-dimensional Glasses arXiv:cond-mat/0209391 (2002)
Paper
Abstract I describe the classic circle-packing problem on a sphere, and the analytic and numerical approaches that have been used to study it. I then present a very simple Markov-chain Monte Carlo algorithm, which succeeds in finding the best solutions known today. The behavior of the algorithm is put into the context of the statistical physics of glasses.
Electronic version (from arXiv)
Context
The material in this paper is taken up in Section 7.1 of my 2006 book "Statistical Mechanics: Algorithms and Computations".
Python implementation
Under construction
