High-precision entropy values for spanning trees in lattices
From MaRDI portal
Publication:4451226
DOI10.1088/0305-4470/36/31/301zbMATH Open1099.82503arXivmath-ph/0304047OpenAlexW3101221984MaRDI QIDQ4451226FDOQ4451226
Authors: Jessica L. Felker, Russell Lyons
Publication date: 23 February 2004
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math-ph/0304047
Recommendations
Cited In (13)
- On the entropy of spanning trees on a large triangular lattice
- The evaluation of the number and the entropy of spanning trees on generalized small-world networks
- Explicit bounds for the return probability of simple random walks
- Estimating Mahler measures using periodic points for the doubling map
- The number of spanning trees for Sierpiński graphs and data center networks
- Spanning trees on the Sierpinski gasket
- Enumeration of spanning trees on contact graphs of disk packings
- Enumeration of spanning trees in planar unclustered networks
- Zeta functions, heat kernels, and spectral asymptotics on degenerating families of discrete tori
- The number of spanning trees in Apollonian networks
- Counting spanning trees in self-similar networks by evaluating determinants
- Historical face of number theory(ists) at the turn of the 19th century
- Title not available (Why is that?)
This page was built for publication: High-precision entropy values for spanning trees in lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451226)