Related papers: Bethe approximation for self-interacting lattice t…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

In this paper, we review a few known facts on the coordinate Bethe ansatz. We present a detailed construction of the Bethe ansatz vector $\psi$ and energy $\Lambda$, which satisfy $V \psi = \Lambda \psi$, where $V$ is the the transfer…

In statistical physics, one of the standard methods to study second order phase transitions is the renormalization group that usually leads to an expansion around the corresponding fully connected solution. Unfortunately, often in…

Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…

A new class of bootstrap percolation models in which particle culling occurs only for certain numbers of nearest neighbours is introduced and studied on a Bethe lattice. Upon increasing the density of initial configuration they undergo…

The lattice cluster theory (LCT) for the thermodynamics of polymer systems has recently been reformulated to treat strongly interacting self-assembling polymers composed of fully flexible linear telechelic chains [J. Dudowicz and K. F.…

We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…

We study magnetic polymers, defined as self-avoiding walks where each monomer $i$ carries a "spin'' $s_i$ and interacts with its first neighbor monomers, let us say $j$, via a coupling constant $J(s_i,s_j)$. Ising-like [$s_i = \pm 1$, with…

We study the phase diagram at finite temperature of a system of Fermi particles on the sites of the Bethe lattice with coordination number z and interacting through onsite U and nearest-neighbor V interactions. This is a physical…

We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$…

We consider the $s$-$t$-path TSP: given a finite metric space with two elements $s$ and $t$, we look for a path from $s$ to $t$ that contains all the elements and has minimum total distance. We improve the approximation ratio for this…

We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance…

Ising model with competing nearest-neighbors and prolonged next-nearest-neighbors interactions on a Cayley tree has long been studied but there are still many problems untouched. This paper tackles new Gibbs measures of Ising-Vannimenus…

In this paper we consider the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods…

Some features of integrable lattice models are reviewed for the case of the six-vertex model. By the Bethe ansatz method we derive the free energy of the six-vertex model. Then, from the expression of the free energy we show analytically…

We have investigated a polymer growth process on the triangular lattice where the configurations produced are self-avoiding trails. We show that the scaling behaviour of this process is similar to the analogous process on the square…

We consider a 3-dimensional lattice model of a network-forming fluid, which has been recently investigated by Girardi and coworkers by means of Monte Carlo simulations [J. Chem. Phys. \textbf{126}, 064503 (2007)], with the aim of describing…

A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ such that the distance in $T$ between every pair of verices is at most $t$ times the distance in $G$ between them. There are efficient algorithms that find a tree $t\cdot…

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…

We use the phase field crystal model to study nucleation of edge dislocations in two dimensions under an applied stress field. A dislocation dipole nucleates under the applied stress, consistent with Burgers vector conservation. The phase…