May 12, 2004
We present an alternative procedure for solving the eigenvalue problem of replicated transfer matrices describing disordered spin systems with (random) 1D nearest neighbor bonds and/or random fields, possibly in combination with (random) long range bonds. Our method is based on transforming the original eigenvalue problem for a $2^n\times 2^n$ matrix (where $n\to 0$) into an eigenvalue problem for integral operators. We first develop our formalism for the Ising chain with random bonds and fields, where we recover known results. We then apply our methods to models of spins which interact simultaneously via a one-dimensional ring and via more complex long-range connectivity structures, e.g. $1+\infty$ dimensional neural networks and `small world' magnets. Numerical simulations confirm our predictions satisfactorily.
Similar papers 1
February 19, 2004
We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest neighbour bonds along the ring are ferromagnetic, whereas those corresponding to the Poisonnian graph are allowed to be random. Our models thus generally contain quenched connectivity and bond disorder. Within the replica formalism, calculating...
August 29, 1996
We analyse the eigenvalue structure of the replicated transfer matrix of one-dimensional disordered Ising models. In the limit of $n \rightarrow 0$ replicas, an infinite sequence of transfer matrices is found, each corresponding to a different irreducible representation (labelled by a positive integer $\rho$) of the permutation group. We show that the free energy can be calculated from the replica symmetric subspace ($\rho =0$). The other ``replica symmetry broken'' represent...
December 19, 1996
We present a statistical analysis of spectra of transfer matrices of classical lattice spin models; this continues the work on the eight-vertex model of the preceding paper. We show that the statistical properties of these spectra can serve as a criterion of integrability. It provides also an operational numerical method to locate integrable varieties. In particular, we distinguish the notions of integrability and criticality considering the two examples of the three-dimensio...
We study the synchronous stochastic dynamics of the random field and random bond Ising chain. For this model the generating functional analysis methods of De Dominicis leads to a formalism with transfer operators, similar to transfer matrices in equilibrium studies, but with dynamical paths of spins and (conjugate) fields as arguments, as opposed to replicated spins. In the thermodynamic limit the macroscopic dynamics is captured by the dominant eigenspace of the transfer ope...
July 25, 2019
The aim of this work is to present a formulation to solve the one-dimensional Ising model using the elementary technique of mathematical induction. This formulation is physically clear and leads to the same partition function form as the transfer matrix method, which is a common subject in the introductory courses of statistical mechanics. In this way our formulation is a useful tool to complement the traditional more abstract transfer matrix method. The method can be straigh...
February 4, 2004
We present an exact solution of a one-dimensional Ising chain with both nearest neighbor and random long-range interactions. Not surprisingly, the solution confirms the mean field character of the transition. This solution also predicts the finite-size scaling that we observe in numerical simulations.
September 19, 2019
Complex networks with directed, local interactions are ubiquitous in nature, and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise naturally in this context, and are key to describing statistical properties of the non-equilibrium dynamics that emerges from interactions within the network structure. Here, we study one-dimensional (1d) spatial structures and focus on sparse non-...
January 20, 2014
Using a formalism based on the spectral decomposition of the replicated transfer matrix for disordered Ising models, we obtain several results that apply both to isolated one-dimensional systems and to locally tree-like graph and factor graph (p-spin) ensembles. We present exact analytical expressions, which can be efficiently approximated numerically, for many types of correlation functions and for the average free energies of open and closed finite chains. All the results a...
June 1, 2001
We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a localisation problem belonging to one of a set of non-standard symmetry classes, known as class D; the transition between paramagnet and ferromagnet is equivalent to a delocalisation transition between an insulator and a quantum Hall conductor...
April 8, 1996
The full spectrum of transfer matrices of the general eight-vertex model on a square lattice is obtained by numerical diagonalization. The eigenvalue spacing distribution and the spectral rigidity are analyzed. In non-integrable regimes we have found eigenvalue repulsion as for the Gaussian orthogonal ensemble in random matrix theory. By contrast, in integrable regimes we have found eigenvalue independence leading to a Poissonian behavior, and, for some points, level clusteri...