Related papers: Graphical representations and cluster algorithms f…
Interactive visualization of embedding projections is a useful technique for understanding data and evaluating machine learning models. Labeling data within these visualizations is critical for interpretation, as labels provide an overview…
A parallel version of the invaded cluster algorithm is described. Results from large scale (up to 4096^2 and 512^3) simulations of the Ising model are reported. No evidence of critical slowing down is found for the three-dimensional Ising…
For the FK representation of the Ising model, we prove that the slab percolation threshold coincides with the critical temperature in any dimension larger or equal to three.
A geometric approach to critical fluctuations of a nonequilibrium model is reported. The two-dimensional majority vote model was investigated by Monte Carlo simulations on square lattices of various sizes and a detailed scaling analysis of…
The stacking problem is approached by computational mechanics, using an Ising next nearest neighbor model. Computational mechanics allows to treat the stacking arrangement as an information processing system in the light of a symbol…
We explore the phase diagram of Ising spins on one-dimensional chains which criss-cross in two perpendicular directions and which are connected by interchain couplings. This system is of interest as a simpler, classical analog of a quantum…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
An algoritm for the simulation of the 3--dimensional random field Ising model with a binary distribution of the random fields is presented. It uses multi-spin coding and simulates 64 physically different systems simultaneously. On one…
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called Extremal Optimization, is compared to Simulated Annealing in…
We have studied the nucleation in the two dimensional Ising model by Monte Carlo simulation. The nucleation time has been studied as a function of the magnetic field for various system sizes. The logarithm of the nucleation time is found to…
Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical…
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…
All standard measures of bipartite entanglement in one-dimensional quantum field theories can be expressed in terms of correlators of branch point twist fields, here denoted by $\mathcal{T}$ and $\mathcal{T}^\dagger$. These are symmetry…
We report on numerical simulations of the two-dimensional spin-$1$ Blume-Capel ferromagnet embedded in a triangular lattice. Utilizing a range of Monte Carlo and finite-size scaling techniques, we explore several critical aspects along the…
We analyze clustering and (local) recurrence of a standard Markov process model of spatial domain coarsening. The continuous time process, whose state space consists of assignments of +1 or -1 to each site in ${\bf Z}^2$, is the…
In the simple [hyper]cubic five dimension near neighbor interaction Ising ferromagnet, extensive simulation measurements are made of the link overlap and the spin overlap distributions. These "two replica" measurements are standard in the…
We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…
Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number…
We analyze the infinite range Ising spin-glass in a transverse-field below the critical temperature by a one step replica symmetry theory(1S-RSB). The set of n replicas is divided in r blocks of m replicas each. We present results for…
We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific…