Entropy of unimodular Lattice Triangulations
arXiv:1412.2541 · doi:10.1209/0295-5075/109/40011
Abstract
Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number of possible triangulations is unknown for large systems. We present a novel algorithm for an approximate enumeration which is based on calculations of the density of states using the Wang-Landau flat histogram sampling. For triangulations on two-dimensional integer lattices we achive excellent agreement with known exact numbers of small triangulations as well as an improvement of analytical calculated asymptotics. The entropy density is consistent with rigorous upper and lower bounds. The presented numerical scheme can easily be applied to other counting and optimization problems.
arXiv comment6 pages, 7 figures
References in corpus (12)
- An efficient, multiple range random walk algorithm to calculate the density of states
- Reconstructing the Universe
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Transition Matrix Monte Carlo Method
- Wang-Landau Algorithm: a Theoretical Analysis of the Saturation of the Error
- Avoiding Boundary Effects in Wang-Landau Sampling
- Second- and First-Order Phase Transitions in CDT
- Flat Histogram Method of Wang-Landau and N-fold Way
- Residual Entropy of Ordinary Ice from Multicanonical Simulations
- Exploring complex networks via topological embedding on surfaces
- Freezing of Triangulations
- Flat histogram Monte Carlo simulations of triangulated fixed-connectivity surface models