English
Related papers

Related papers: The worm algorithm for the Ising model is rapidly …

200 papers

A powerful existing technique for evaluating statistical mechanical quantities in two-dimensional Ising models is based on constructing a matrix representing the nearest neighbor spin couplings and then evaluating the Pfaffian of the…

Disordered Systems and Neural Networks · Physics 2013-04-16 Creighton K. Thomas , A. Alan Middleton

We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two dimensional square lattice. We use a finite size scaling…

Statistical Mechanics · Physics 2009-10-30 P. R. A. Campos , R. N. Onody

In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from…

Discrete Mathematics · Computer Science 2015-03-19 Alistair Sinclair , Piyush Srivastava , Marc Thurley

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…

Statistical Mechanics · Physics 2022-10-03 Nicolas Sadoune , Lode Pollet

We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birth-and-death processes. Examples include area- and…

Probability · Mathematics 2011-11-10 Roberto Fernandez , Pablo A. Ferrari , Nancy Garcia

We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…

Quantum Physics · Physics 2013-05-30 V. Karimipour , M. H. Zarei

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…

Statistical Mechanics · Physics 2015-05-13 Zhi-Huan Luo , Mushtaq Loan , Yan Liu , Jian-Rong Lin

This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…

Statistical Mechanics · Physics 2013-09-17 Jack Raymond , K. Y. Michael Wong

A periodic Ising model is one endowed with interactions that are invariant under translations of members of a full-rank sublattice $\mathfrak{L}$ of $\mathbb{Z}^2$. We give an exact, quantitative description of the critical temperature,…

Mathematical Physics · Physics 2012-04-10 Zhongyang Li

The phase transition of a random mixed-bond Ising ferromagnet on a cubic lattice model is studied both numerically and analytically. In this work, we use the Cluster algorithms of Wolff and Glauber to simulate the dynamics of the system. We…

Disordered Systems and Neural Networks · Physics 2010-02-02 J. B. Santos-Filho , N. O. Moreno , Douglas F. de Albuquerque

An Ising model with ferromagnetic nearest-neighbor interactions $J_{1}$ ($J_{1}>0$) and random next-nearest-neighbor interactions [$+J_{2}$ with probability $p$ and $-J_{2}$ with probability $(1-p)$; $J_{2}>0$] is studied within the…

Statistical Mechanics · Physics 2009-06-22 Octavio R. Salmon , J. Ricardo de Sousa , Fernando D. Nobre

We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…

Data Structures and Algorithms · Computer Science 2021-09-15 Valerii Likhosherstov , Yury Maximov , Michael Chertkov

We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. The loop models describing the dynamics of the fermions can be mapped…

High Energy Physics - Lattice · Physics 2009-11-05 Urs Wenger

We present a new way to make Ising machines, i.e., using networks of coupled self-sustaining nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes that the phase dynamics of coupled oscillator systems,…

Emerging Technologies · Computer Science 2019-03-19 Tianshi Wang , Jaijeet Roychowdhury

Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…

Data Structures and Algorithms · Computer Science 2021-08-27 Tyler Helmuth , Holden Lee , Will Perkins , Mohan Ravichandran , Qiang Wu

We consider testing for the parameters of Ferromagnetic Ising models. While testing for the presence of possibly sparse magnetizations, we provide a general lower bound of minimax separation rates which yields sharp results in high…

Statistics Theory · Mathematics 2019-06-04 Rajarshi Mukherjee , Gourab Ray

We discuss worm algorithms for the 3-state Potts model with external field and chemical potential. The complex phase problem of this system can be overcome by using a flux representation where the new degrees of freedom are dimer and…

High Energy Physics - Lattice · Physics 2012-07-20 Ydalia Delgado , Hans Gerd Evertz , Christof Gattringer

We study the convergence properties of Glauber dynamics for the random field Ising model (RFIM) with ferromagnetic interactions on finite domains of $\mathbb{Z}^d$, $d \ge 2$. Of particular interest is the Griffiths phase where correlations…

Probability · Mathematics 2024-11-14 Ahmed El Alaoui , Ronen Eldan , Reza Gheissari , Arianna Piana

We consider the problem of estimating the partition function of the ferromagnetic Ising model in a consistent external magnetic field. The estimation is done via importance sampling in the dual of the Forney factor graph representing the…

Computation · Statistics 2017-01-27 Mehdi Molkaraie

We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration…

Disordered Systems and Neural Networks · Physics 2015-05-28 S. Yoon , A. V. Goltsev , S. N. Dorogovtsev , J. F. F. Mendes