Related papers: Exact Algorithm for Sampling the 2D Ising Spin Gla…
The Ising spin glass in two dimensions exhibits rich behavior with subtle differences in the scaling for different coupling distributions. We use recently developed mappings to graph-theoretic problems together with highly efficient…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
We present an algorithm for finding ground states of two dimensional spin glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximate…
Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time…
This paper reports numerical studies of a compressible version of the Ising spin glass in two dimensions. Compressibility is introduced by adding a term that couples the spin-spin interactions and local lattice deformations to the standard…
We analyze the zero-temperature behavior of the XY Edwards-Anderson spin glass model on a square lattice. A newly developed algorithm combining exact ground-state computations for Ising variables embedded into the planar spins with a…
We present results of recent high-statistics Monte Carlo simulations of the Edwards-Anderson Ising spin-glass model in three and four dimensions. The study is based on a non-Boltzmann sampling technique, the multi-overlap algorithm which is…
We demonstrate that a recently introduced heuristic optimization algorithm [Phys. Rev. E 83, 046709 (2011)] that combines a local search with triadic crossover genetic updates is capable of sampling nearly uniformly among ground-state…
We study statistical properties of 3D classical spin glass layer of certain width and infinite length. The 3D spin glass is represented as an ensemble of disordered 1D spatial spin-chains (SSC) where interactions are random between…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n…
We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…
Isothermal simulational data for the 3D Edwards-Anderson spin glass are collected at several temperatures below $T_{\rm c}$ and, in analogy with a recent model of dense colloidal suspensions,interpreted in terms of clusters of contiguous…
Spin glasses are fundamental probability distributions at the core of statistical physics, the theory of average-case computational complexity, and modern high-dimensional statistical inference. In the mean-field setting, we design…
We study a two-dimensional compressible Ising spin glass at constant volume. The spin interactions are coupled to the distance between neighboring particles in the Edwards-Anderson model with +/- J interactions. We find that the energy of a…
This article is a contribution to the understanding of fluctuations in the out of equilibrium dynamics of glassy systems. By extending theoretical ideas based on the assumption that time-reparametrization invariance develops asymptotically…
We present a perfect marginal sampler of the unique Gibbs measure of a spin system on $\mathbb Z^2$. The algorithm is an adaptation of a previous `lazy depth-first' approach by the authors, but relaxes the requirement of strong spatial…
We adapted the SWAP molecular dynamics algorithm for use in lattice Ising spin models. We dressed the spins with a randomly distributed length and we alternated long-range spin exchanges with conventional single spin flip Monte Carlo…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…