Related papers: Simulating the All-Order Strong Coupling Expansion…
The equilibrium phase behavior of microphase-forming systems is notoriously difficult to obtain because of the extended metastability of their modulated phases. In this paper we present a systematic simulation methodology for studying…
The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems have been considered,…
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…
The Ising model is famous model for magnetic substances in Statistical Physics, and has been greatly studied in many forms. It was solved in one-dimension by Ernst Ising in 1925 and in two-dimensions without an external magnetic field by…
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…
Integrated sensing and communication (ISAC) technology is vital for vehicular networks, yet the time-varying communication channels and rapid movement of targets present significant challenges for real-time precoding design. Traditional…
To investigate the properties of $c=1$ matter coupled to $2$d{--}gravity we have performed large-scale simulations of two copies of the Ising Model on a dynamical lattice. We measure spin susceptibility and percolation critical exponents…
We describe a new algorithm for the perfect simulation of variable length Markov chains and random systems with perfect connections. This algorithm, which generalizes Propp and Wilson's simulation scheme, is based on the idea of coupling…
The finite lattice method of series expansion is generalised to the $q$-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained,…
In this paper, we consider the harmonic extension problem, which is widely used in many applications of machine learning. We find that the transitional method of graph Laplacian fails to produce a good approximation of the classical…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
The lace expansion has been a powerful tool for investigating mean-field behavior for various stochastic-geometrical models, such as self-avoiding walk and percolation, above their respective upper-critical dimension. In this paper, we…
The cluster variation method (CVM) is an approximation technique which generalizes the mean field approximation and has been widely applied in the last decades, mainly for finding accurate phase diagrams of Ising-like lattice models. Here…
Spin networks appear in a number of areas, for instance in lattice gauge theories and in quantum gravity. They describe the contraction of intertwiners according to the underlying network. We show that a certain generating function of…
We show that high-temperature expansions may serve as a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed path configurations (produced by high-temperature expansions)…
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum…
Ising model with quenched random magnetic fields is examined for single Gaussian, bimodal and double Gaussian random field distributions by introducing an effective field approximation that takes into account the correlations between…
We investigate the application of graph-cut methods for the study of the critical behaviour of the two-dimensional random-field Ising model. We focus on exact ground-state calculations, crossing the phase boundary of the model at zero…
Combinatorial optimization problems are crucial in industry. However, many COPs are NP-hard, causing the search space to grow exponentially with problem size and rendering large-scale instances computationally intractable. Conventional…
We study the 2D Ising model on a square lattice with additional non-equal diagonal next-nearest neighbor interactions. The cases of classical and quantum (transverse) models are considered. Possible phases and their locations in the space…