Related papers: Lifted Worm Algorithm for the Ising Model
We enlighten some critical aspects of the three-dimensional ($d=3$) random-field Ising model from simulations performed at zero temperature. We consider two different, in terms of the field distribution, versions of model, namely a Gaussian…
A new and efficient algorithm is presented for the calculation of the partition function in the $S=\pm 1$ Ising model. As an example, we use the algorithm to obtain the thermal dependence of the magnetic spin susceptibility of an Ising…
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
We present an algorithm for the efficient simulation of the half-filled spinless $t$-$V$ model on bipartite lattices, which combines the stochastic series expansion method with determinantal quantum Monte Carlo techniques widely used in…
Conventional computing architectures have no known efficient algorithms for combinatorial optimization tasks, which are encountered in fundamental areas and real-world practical problems including logistics, social networks, and…
We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…
In this paper, we study the problem of finding the global minima of a given function. Specifically, we consider complicated functions with numerous local minima, as is often the case for real-world data mining losses. We do so by applying a…
A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…
The energy landscape for the random-field Ising model (RFIM) is complex, yet algorithms such as the push-relabel algorithm exist for computing the exact ground state of an RFIM sample in time polynomial in the sample volume. Simulations…
This paper is concerned with parameter identification problem for finite impulse response (FIR) systems with binary-valued observations under low computational complexity. Most of the existing algorithms under binary-valued observations…
Gradient compression is of growing interests for solving constrained optimization problems including compressed sensing, noisy recovery and matrix completion under limited communication resources and storage costs. Convergence analysis of…
Variational tensor network optimization has become a powerful tool for studying classical statistical models in two dimensions. However, its application to three-dimensional systems remains limited, primarily due to the high computational…
Nonequilibrium relaxation behaviors in the Ising model on a square lattice based on the Wolff algorithm are totally different from those based on local-update algorithms. In particular, the critical relaxation is described by the…
The graph-theoretical task of determining most likely inter-community edges based on disconnected subgraphs' intra-community connectivity is proposed. An algorithm is developed for this edge augmentation task, based on elevating the zero…
A master equation approach is applied to a reversible and conservative cellular automata model (Q2R). The Q2R model is a dynamical variation of the Ising model for ferromagnetism that possesses quite a rich and complex dynamics. The…
Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully…
We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
We present an efficient Monte Carlo algorithm for the simulation of the two-dimensional Random Field Ising Model (RFIM). The method combines the event-driven, rejection-free character of the Bortz Kalos-Lebowitz (BKL) algorithm with Glauber…
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…