Related papers: Monte Carlo simulation of spin models with long-ra…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
We propose a new efficient scheme for the quantum Monte Carlo study of quantum critical phenomena in quantum spin systems. Rieger and Young's Trotter-number-dependent finite-size scaling in quantum spin systems and Ito {\it et al.}'s…
Spin glasses are paradigmatic models that deliver concepts relevant for a variety of systems. However, rigorous analytical results are difficult to obtain for spin-glass models, in particular for realistic short-range models. Therefore…
Binary magnetic square lattice Ising system with nearest neighbour interactions were simulated using the Monte Carlo technique. Two types of ions were randomly distributed on the lattice sites, one type interacting ferromagnetic and the…
Extensive Monte Carlo simulations in the semi-grand-canonical ensemble are used to study the critical behavior of a three-dimensional compressible Ising model with antiferromagnetic interactions under constant volume conditions. Elastic…
We study the spin-$1/2$ Ising chain with multispin interactions $K$ involving the product of $m$ successive spins, for general values of $m$. Using a change of spin variables the zero-field partition function of a finite chain is obtained…
We investigate phase transitions of two-dimensional Ising models with power-law interactions, using an efficient Monte Carlo algorithm. For slow decay, the transition is of the mean-field type; for fast decay, it belongs to the short-range…
We propose a new quantum Monte Carlo algorithm which realizes a relaxation intrinsic to the original quantum system. The Monte Carlo dynamics satisfies the dynamic scaling relation $\tau\sim \xi^z$ and is independent of the Trotter number.…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…
A quantum Monte Carlo algorithm is constructed starting from the standard perturbation expansion in the interaction representation. The resulting configuration space is strongly related to that of the Stochastic Series Expansion (SSE)…
Recent Monte Carlo simulations of the critical point of the restricted primitive model for ionic solutions are reported. Only the continuum version of the model is considered. A finite size scaling analysis based in the Bruce-Wilding…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
In the finite-size scaling analysis of Monte Carlo data, instead of computing the observables at fixed Hamiltonian parameters, one may choose to keep a renormalization-group invariant quantity, also called phenomenological coupling, fixed…
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of…
We present results of a Monte Carlo study of the equilibrium dynamics of the one dimensional long-range Ising spin glass model. By tuning a parameter $\sigma$, this model interpolates between the mean field Sherrington-Kirkpatrick model and…
These lecture notes introduce quantum spin systems and several computational methods for studying their ground-state and finite-temperature properties. Symmetry-breaking and critical phenomena are first discussed in the simpler setting of…
We show how to apply the absorbing Markov chain Monte Carlo algorithm of Novotny to simulate kinetically constrained models of glasses. We consider in detail one-spin facilitated models, such as the East model and its generalizations to…
A new Markov Chain Monte Carlo method for simulating the dynamics of molecular systems characterized by hard-core interactions is introduced. In contrast to traditional Kinetic Monte Carlo approaches, where the state of the system is…
We present a Monte Carlo simulation framework for analysing the risk involved in deploying real-time control systems in safety-critical applications, as well as an algorithm design technique allowing one (in certain situations) to robustify…