相关论文: Graphical representations and cluster algorithms f…
A graphical representation based on duplication is developed that is suitable for the study of Ising systems in external fields. Two independent replicas of the Ising system in the same field are treated as a single four-state…
The dynamic critical behavior of the two-replica cluster algorithm is studied. Several versions of the algorithm are applied to the two-dimensional, square lattice Ising model with a staggered field. The dynamic exponent for the full…
A cluster algorithm formulated in continuous (imaginary) time is presented for Ising models in a transverse field. It works directly with an infinite number of time-slices in the imaginary time direction, avoiding the necessity to take this…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
The critical behaviour of many spin models can be equivalently formulated as percolation of specific site-bond clusters. In the presence of an external magnetic field, such clusters remain well-defined and lead to a percolation transition,…
In random percolation one finds that the mean field regime above the upper critical dimension can simply be explained through the coexistence of infinite percolating clusters at the critical point. Because of the mapping between percolation…
Scanning probes reveal complex, inhomogeneous patterns on the surface of many condensed matter systems. In some cases, the patterns form self-similar, fractal geometric clusters. In this paper, we advance the theory of criticality as it…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
The fractal dimensions and the percolation exponents of the geometrical spin clusters of like sign at criticality, are obtained numerically for an Ising model with temperature-dependent annealed bond dilution, also known as the thermalized…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
Geometric representations provide a useful perspective on critical phenomena in the Ising model. In a recent study [Phys. Rev. E 112, 034118 (2025)], we found that the two-dimensional critical Ising model exhibits two consecutive…
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…
Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different methods and algorithms applied. However, many of these…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
Clusters in the three-dimensional Ising model rigorously obey reducibility and thermal scaling up to the critical temperature. The barriers extracted from Arrhenius plots depend on the cluster size as $B \propto A^{\sigma}$ where $\sigma$…
We study the percolation properties of geometrical clusters defined in the overlap space of two statistically independent replicas of a square-lattice Ising model that are simulated at the same temperature. In particular, we consider two…
Simple algorithm of dynamics of Ising magnetic is described. The algorithm can be implemented on conventional digital computer and can be used for construction of specialized processor for simulation of ferromagnetic systems. The algorithm…
The ferromagnet-to-paramagnet transition of the four-dimensional random-field Ising model with Gaussian distribution of the random fields is studied. Exact ground states of systems with sizes up to 32^4 are obtained using graph theoretical…
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…