Related papers: Correspondence between spanning trees and the Isin…
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…
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…
The Ising model is an equilibrium stochastic process used as a model in several branches of science including magnetic materials, geophysics, neuroscience, sociology and finance. Real systems of interest have finite size and a fixed…
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…
This work establishes links between the Ising model and elliptic curves via Mahler measures. First, we reformulate the partition function of the Ising model on the square, triangular and honeycomb lattices in terms of the Mahler measure of…
We prove that the squared partition function of the two-dimensional critical Ising model defined on a finite, isoradial graph $G=(V,E)$, is equal to $2^{|V|}$ times the partition function of spanning trees of the graph $\bar{G}$, where…
The problem of N interacting spins on a lattice is equivalent to one of N clusters linked in a specific manner. The energy of any configuration of spins can be expressed in terms of the energy levels of this cluster. A new expression is…
The partition function of the square lattice Ising model on the rectangle with open boundary conditions in both directions is calculated exactly for arbitrary system size $L\times M$ and temperature. We start with the dimer method of…
Low-temperature expansion of Ising model has long been a topic of significant interest in condensed matter and statistical physics. In this paper we present new results of the coefficients in the low-temperature series of the Ising…
We study the Ising model on $\mathbb{Z}^{2}$ and show, via numerical simulation, that allowing interactions between spins separated by distances $1$ and $m$ (two ranges), the critical temperature, $ T_c (m) $, converges monotonically to the…
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Markov chain Monte Carlo methods for this problem have been…
The partition functions for two-dimensional nearest neighbour Ising model in a non-zero magnetic field have been derived for finite square lattices with the help of graph theoretical procedures, show-bit algorithm, enumeration of…
A kinetic one-dimensional Ising model on a ring evolves according to a generalization of Glauber rates, such that spins at even (odd) lattice sites experience a temperature $T_{e}$ ($T_{o}$). Detailed balance is violated so that the spin…
The method of counting loops for calculating the partition function of the Ising model on the two dimensional square lattice is extended to lacunary planar lattices, especially scale invariant fractal lattices, the Sierpi\'nsky carpets with…
Extensive Monte Carlo study of two-dimensional Ising model is done to investigate the statistical behavior of spin clusters and interfaces as a function of temperature, $T$. We use a \emph{tie-breaking} rule to define interfaces of spin…
In this paper we present a simple, yet typical simulation in statistical physics, consisting of large scale Monte Carlo simulations followed by an involved statistical analysis of the results. The purpose is to provide an example…
We explore short-distance static correlation functions in the infinite XXZ chain using previously derived formulae which represent the correlation functions in factorized form. We compute two-point functions ranging over 2, 3 and 4 lattice…
An inhomogeneous random recursive lattice was constructed from the multi-branched Husimi square lattice. The number of repeating units connected on one vertex was randomly set to be 2 or 3 with a quenched ratio $P_2$ or $P_3$ with…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…