High-precision entropy values for spanning trees in lattices
From MaRDI portal
Publication:4451226
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.
Recommendations
Cited in
(13)- Enumeration of spanning trees on contact graphs of disk packings
- On the entropy of spanning trees on a large triangular lattice
- 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 for Sierpiński graphs and data center networks
- Estimating Mahler measures using periodic points for the doubling map
- Counting spanning trees in self-similar networks by evaluating determinants
- Explicit bounds for the return probability of simple random walks
- Spanning trees on the Sierpinski gasket
- scientific article; zbMATH DE number 1750458 (Why is no real title available?)
- The evaluation of the number and the entropy of spanning trees on generalized small-world networks
- The number of spanning trees in Apollonian networks
- Historical face of number theory(ists) at the turn of the 19th century
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)