Related papers: Computing Masses from Effective Transfer Matrices
By using the results of a high-statistics (O(10^7) measurements) Monte Carlo simulation we test several predictions of perturbation theory on the O(n) non-linear sigma-model in 2 dimensions. We study the O(3) and O(8) models on large enough…
The presence of erratic or unstable paths in standard kinetic Monte Carlo simulations significantly undermines the accurate simulation and sampling of transition pathways. While typically reliable methods, such as the Gillespie algorithm,…
Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
Cross-Correlation random matrices have emerged as a promising indicator of phase transitions in spin systems. The core concept is that the evolution of magnetization encapsulates thermodynamic information [R. da Silva, Int. J. Mod. Phys. C,…
This paper considers clustered multi-task compressive sensing, a hierarchical model that solves multiple compressive sensing tasks by finding clusters of tasks that leverage shared information to mutually improve signal reconstruction. The…
This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the…
We present a Monte Carlo algorithm that allows the simultaneous determination of a few extremal eigenpairs of a very large matrix without the need to compute the inner product of two vectors or store all the components of any one vector.…
To further reduce the lattice thermal conductivity of thermoelectric materials, the technique of embedding nano-inclusions into bulk matrix materials, in addition to point defect scattering via alloying, was widely applied. Differential…
Lattice effective field theory applies the principles of effective field theory in a lattice framework where space and time are discretized. Nucleons are placed on the lattice sites, and the interactions are tuned to replicate the observed…
The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many ensuing applications rely on the fact that complicated spin…
The power of matrix product states to describe infinite-size translational-invariant critical spin chains is investigated. At criticality, the accuracy with which they describe ground state properties of a system is limited by the size…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
The exact perturbation approach is used to derive the elementary correlation lengths $\xi_i$ and related mass gaps $m_i$ of the two-dimensional dilute A_L lattice model in regimes 1 and 2 for L odd from the Bethe Ansatz solution. In regime…
We use Monte Carlo simulations to study polymer melts consisting of fully flexible and moderately stiff chains in the bond fluctuation model at a volume fraction $0.5$. In order to reduce the local density fluctuations, we test a…
The paper discusses the transformation of decorated Ising models into an effective \textit{undecorated} spin models, using the most general Hamiltonian for interacting Ising models including a long range and high order interactions. The…
We investigate the spin-$1$ Blume-Capel model on an infinite strip of the triangular lattice using the transfer-matrix method combined with a sparse-matrix factorization technique. Through finite-size scaling analysis of numerically exact…
The efficiency of a Markov chain Monte Carlo algorithm might be measured by the cost of generating one independent sample, or equivalently, the total cost divided by the effective sample size, defined in terms of the integrated…
In 2002 Biskup et al. [Europhys. Lett. 60, 21 (2002)] sketched a rigorous proof for the behavior of the 2D Ising lattice gas, at a finite volume and a fixed excess \delta M of particles (spins) above the ambient gas density (spontaneous…
On the base of a Feynman-Kac--type formula involving Poisson stochastic processes, recently a Monte Carlo algorithm has been introduced, which describes exactly the real- or imaginary-time evolution of many-body lattice quantum systems. We…