Related papers: Efficient Monte Carlo algorithm and high-precision…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
In this work we propose a hierarchy of Monte Carlo methods for sampling equilibrium properties of stochastic lattice systems with competing short and long range interactions. Each Monte Carlo step is composed by two or more sub - steps…
We propose an efficient Monte Carlo algorithm for the off-lattice simulation of dense hard sphere polymer melts using cluster moves, called event chains, which allow for a rejection-free treatment of the excluded volume. Event chains also…
A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box,…
We present a new numerical Monte Carlo approach to determine the scaling behavior of lattice field theories far from equilibrium. The presented methods are generally applicable to systems where classical-statistical fluctuations dominate…
We propose a Monte Carlo algorithm to sample from high dimensional probability distributions that combines Markov chain Monte Carlo and importance sampling. We provide a careful theoretical analysis, including guarantees on robustness to…
We report developments of the kinetic Monte Carlo (KMC) method with improved accuracy and increased versatility for the description of atomic diffusivity on metal surfaces. The on-lattice constraint built into our recently proposed…
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer…
The probability of accepting a candidate move in the hybrid Monte Carlo algorithm can be increased by considering a transition to be between windows of several states at the beginning and end of the trajectory, with a state within the…
We present a lattice Monte Carlo algorithm based on the one originally proposed by Maggs and Rossetto for simulating electrostatic interactions in inhomogeneous dielectric media. The original algorithm is known to produce attractive…
A fast computer algorithm, the pebble game, has been used successfully to study rigidity percolation on 2D elastic networks, as well as on a special class of 3D networks, the bond-bending networks. Application of the pebble game approach to…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
Extensive Monte-Carlo simulations were performed to evaluate the excess number of clusters and the crossing probability function for three-dimensional percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered…
We introduce a new Monte Carlo method for pure gauge theories. It is not intended for use with dynamical fermions. It belongs to the class of Local Hybrid Monte Carlo (LHMC) algorithms, which make use of the locality of the action by…
This paper describes a new Monte Carlo method based on a novel stochastic potential switching algorithm. This algorithm enables the equilibrium properties of a system with potential $V$ to be computed using a Monte Carlo simulation for a…
We develop the hybrid Monte Carlo method for simulations of single off-lattice polymer chains. We discuss implementation and choice of simulation parameters in some detail. The performance of the algorithm is tested on models for…
In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…
We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…