May 12, 2004
Similar papers 5
May 8, 2006
We present a certifiable algorithm to calculate the eigenvalue density function -- the number of eigenvalues within an infinitesimal interval -- for an arbitrary 1D interacting quantum spin system. Our method provides an arbitrarily accurate numerical representation for the smeared eigenvalue density function, which is the convolution of the eigenvalue density function with a gaussian of prespecified width. In addition, with our algorithm it is possible to investigate the den...
August 30, 2014
We propose a generic framework to describe classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined sparse "coding" vector associated with the graph. We expect that the existence of a fast Hadamard transform algorithm (used for instance in image ccompression processes), together with the sparseness of the coding vector, may provide ways to fasten the spectrum computation.. Applying this formalism ...
November 29, 2018
This work develops a rigorous setting allowing one to prove several features related to the behaviour of the Heisenberg-Ising (or XXZ) spin-$1/2$ chain at finite temperature $T$. Within the quantum inverse scattering method the physically pertinent observables at finite $T$, such as the \textit{per}-site free energy or the correlation length, have been argued to admit integral representations whose integrands are expressed in terms of solutions to auxiliary non-linear integra...
May 15, 2017
Using methods of statistical physics, we analyse the error of learning couplings in large Ising models from independent data (the inverse Ising problem). We concentrate on learning based on local cost functions, such as the pseudo-likelihood method for which the couplings are inferred independently for each spin. Assuming that the data are generated from a true Ising model, we compute the reconstruction error of the couplings using a combination of the replica method with the...
October 18, 2005
We calculate the number of metastable configurations of Ising small-world networks which are constructed upon superimposing sparse Poisson random graphs onto a one-dimensional chain. Our solution is based on replicated transfer-matrix techniques. We examine the denegeracy of the ground state and we find a jump in the entropy of metastable configurations exactly at the crossover between the small-world and the Poisson random graph structures. We also examine the difference in ...
November 30, 2012
A general technique of exact calculation of any correlation functions for the special class of one-dimensional spin models containing small clusters of quantum spins assembled to a chain by alternating with the single Ising spins is proposed. The technique is a natural generalization of that in the models solved by a classical transfer matrix. The general expressions for corresponding matrix operators which are the key components of the technique are obtained. As it is clear ...
October 5, 1995
We study numerically the critical region and the disordered phase of the random transverse-field Ising chain. By using a mapping of Lieb, Schultz and Mattis to non-interacting fermions, we can obtain a numerically exact solution for rather large system sizes, $L \le 128$. Our results confirm the striking predictions of earlier analytical work and, in addition, give new results for some probability distributions and scaling functions.
October 31, 1994
Contents: A. Introduction B. High Temperature Expansions for the Ising Model C. Characteristic Functions and Cumulants D. The One Dimensional Chain E. Directed Paths and the Transfer Matrix F. Moments of the Correlation Function G. The Probability Distribution in Two Dimensions H. Higher Dimensions I. Random Signs J. Other Realizations of DPRM K. Quantum Interference of Strongly Localized Electrons L. The Locator Expansion and Forward Scattering Paths ...
February 12, 2019
We investigate the proposal that for weakly coupled two-dimensional magnets the transition temperature scales with a critical exponent which is equivalent to that of the susceptibility in the underlying two-dimensional model, $ \gamma $. Employing the exact diagonalization of transfer matrices we can determine the critical temperature for Ising models accurately and then fit to approximate this critical exponent. We find an additional logarithm is required to predict the tran...
February 3, 2022
Using the transfer matrix method for Axial Next-Nearest Neighbor Ising model without an external field on a closed chain of spins of width 2 in the direction of interaction of only nearest neighbors and length L in the direction of interaction of nearest neighbors and next nearest neighbors, we found exact values of the partition function in a finite strip of length L , free energy, internal energy per node, heat capacity in a finite strip of length L and in the thermodynamic...