Related papers: Computational complexity of spin-glass three-dimen…
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…
A relation between O$(n)$ models and Ising models has been recently conjectured [L. Casetti, C. Nardini, and R. Nerattini, Phys. Rev. Lett. 106, 057208 (2011)]. Such a relation, inspired by an energy landscape analysis, implies that the…
Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve…
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence…
We present highly accurate Monte Carlo results for simple cubic Ising lattices containing up to $256^3$ spins. These results were obtained by means of the Cluster Processor, a newly built special-purpose computer for the Wolff cluster…
We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model…
By quenched-randomly mixing local units of different spatial dimensionalities, we have studied Ising spin-glass systems on hierarchical lattices continuously in dimensionalities 1 =< d =< 3. The global phase diagram in temperature,…
We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
We performed numerical simulations of 2D and 3D Edwards-Anderson spin glass models by using the recently developed multicanonical ensemble. Our ergodicity times increase with the lattice size approximately as $V^3$. The energy, entropy and…
The critical temperature of a three-dimensional Ising model on a simple cubic lattice with different coupling strengths along all three spatial directions is calculated via the transfer matrix method and a finite size scaling for L x L oo…
We present a random-interface representation of the three-dimensional (3D) Ising model based on thermal fluctuations of a uniquely defined geometric spin cluster in the 3D model and its 2D cross section. Extensive simulations have been…
The influence of correlated impurities on the critical behaviour of the 3D Ising model is studied using Monte Carlo simulations. Spins are confined into the pores of simulated aerogels (diffusion limited cluster-cluster aggregation) in…
The ferromagnetic Ising model on an $n\times n$ square lattice region $\Lambda$ with mixed boundary conditions can exhibit a phase transition as temperature varies. For this spin system, if we fix the spins on the top and bottom sides of…
We study the low-temperature spin-glass phases of the Sherrington-Kirkpatrick (SK) model and of the 3-dimensional short range Ising spin glass (3dISG). For the SK model, evidence for ultrametricity becomes clearer as the system size…
We report single-cluster Monte Carlo simulations of the Ising model on three-dimensional Poissonian random lattices with up to 128,000 approx. 503 sites which are linked together according to the Voronoi/Delaunay prescription. For each…
A three dimensional string model is analyzed in the strong coupling regime. The contribution of surfaces with different topology to the partition function is essential. A set of corresponding models is discovered. Their critical indices,…
In VLSI physical design, many algorithms require the solution of difficult combinatorial optimization problems such as max/min-cut, max-flow problems etc. Due to the vast number of elements typically found in this problem domain, these…
Optical Ising machines have emerged as a promising dynamical hardware solver for computational hard optimization problems. These Ising machines typically require an optical modulator to represent the analog spin variables of these problems.…
Nearest-neighbor-interaction Ising spin glasses are studied on three different hierarchical lattices, all of them belonging to the Wheatstone-Bridge family. It is shown that the spin-glass lower critical dimension in these lattices should…