Related papers: A Lattice Spanning-Tree Entropy Function
The double integral representing the entropy S_{tri} of spanning trees on a large triangular lattice is evaluated using two different methods, one algebraic and one graphical. Both methods lead to the same result S_{tri} = [1/(2 Pi)]^2…
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d in d dimensions under free, periodic, and…
For a two-dimensional lattice $\Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for…
The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q -> 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have…
The cyclic Lotka-Volterra model in a $D$-dimensional regular lattice is considered. Its ``nucleus growth'' mode is analyzed under the scope of Tsallis' entropies $S_q=(1-\sum_i p_i^q)/(q-1)$, $q\in \mathbb{R}$. It is shown both numerically…
For a lattice $\Lambda$ with $n$ vertices and dimension $d$ equal or higher than two, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral…
We show that the entanglement entropy and alpha entropies corresponding to spatial polygonal sets in $(2+1)$ dimensions contain a term which scales logarithmically with the cutoff. Its coefficient is a universal quantity consisting in a sum…
We define the notion of a spanning tree generating function (STGF) $\sum a_n z^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated. By making use of known…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
We compute the Green's function on the double cover of ${\mathbb Z}^2$, branched over a vertex or a face. We use this result to compute the local statistics of the "trunk" of the uniform spanning tree on the square lattice, i.e., the…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
The problem of counting the different ways of folding the planar triangular lattice is shown to be equivalent to that of counting the possible 3-colorings of its bonds, a dual version of the 3-coloring problem of the hexagonal lattice…
It is shown that the Green's function on a finite lattice in arbitrary space dimension can be obtained from that of an infinite lattice by means of translation operator. Explicit examples are given for one- and two-dimensional lattices.
We investigate the behavior of the Gibbs-Shannon entropy of the stationary nonequilibrium measure describing a one-dimensional lattice gas, of L sites, with symmetric exclusion dynamics and in contact with particle reservoirs at different…
We study Markov tree-shifts given by $k$ transition matrices, one for each of its $k$ directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
In this paper we remark that Shannon entropy can be expressed as a function of the self-information (i.e. the logarithm) and the inverse of the Lambert $W$ function. It means that we consider that Shannon entropy has the trace form: $-k…
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
A first order differential equation of Green's Function, at the origin G(0), for the one- dimensional lattice is derived by simple recurrence relation. Green's Function at site (m)is then calculated in terms of G(0). A simple recurrence…
We analyze random resistor networks through a study of lattice Green's functions in arbitrary dimensions. We develop a systematic disorder perturbation expansion to describe the weak disorder regime of such a system. We use this formulation…