High-precision entropy values for spanning trees in lattices
Authors:
- 22 July 2003
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 36 (31) , 8361-8365
Abstract
Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the accuracy. In particular, the new values resolve one of their questions.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Pathologies of the large-N limit for RP−1, CP−1, QP−1 and mixed isovector/isotensor σ-modelsNuclear Physics B, 2001
- Spanning trees on graphs and lattices inddimensionsJournal of Physics A: General Physics, 2000
- Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-ImpedancesThe Annals of Probability, 1993
- THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONSReviews in Mathematical Physics, 1992
- Choosing a Spanning Tree for the Integer Lattice UniformlyThe Annals of Probability, 1991
- The statistics of dimers on a latticePhysica, 1961
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847