Related papers: Polymer simulation by means of tree data-structure…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
We perform simulations for long hard-sphere polymer chains using a recently developed binary-tree based Monte Carlo method. Systems in two to five dimensions with free and periodic boundary conditions and up to $10^7$ repeat units are…
We present a Monte Carlo method that allows efficient and unbiased sampling of Hamiltonian walks on a cubic lattice. Such walks are self-avoiding and visit each lattice site exactly once. They are often used as simple models of globular…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
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…
We point out that a newly introduced recursive algorithm for lattice polymers has a much wider range of applicability. In particular, we apply it to the simulation of off-lattice polymers with Lennard-Jones potentials between non-bonded…
The Monte Carlo carbyne model is modified to investigate the glass transition of the semi-flexible entangled polymer chains. The stochastic bombardment between monomers are monitored by Metropolis algorithm with help of the consideration of…
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…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
We present a new Monte Carlo scheme for the efficient simulation of multi-polymer systems. The method permits chains to be inserted into the system using a biased growth technique. The growth proceeds via the use of a retractable feeler,…
We develop off-lattice simulations of semiflexible polymer chains subjected to applied mechanical forces using Markov Chain Monte Carlo. Our approach models the polymer as a chain of fixed-length bonds, with configurations updated through…
We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
We have developed a technique to accelerate the acquisition of effectively uncorrelated configurations for off-lattice models of dense polymer melts which makes use of both parallel tempering and large scale Monte Carlo moves. The method is…
We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and…
A cell lists method based on doubly linked lists and with complexity O(N) is developed for particle deletion and insertion in reaction ensemble Monte Carlo simulation. Because the random move in Metropolis algorithm can be reduced to…
Monte Carlo simulations of proteins are hindered by the system's high density which often makes local moves ineffective. Here we devise and test a set of long range moves that work well even when all sites of a lattice simulation are…
Monte Carlo dynamics of the lattice 48 monomers toy protein is interpreted as a random walk in an abstract (discrete) space of conformations. To test the geometry of this space, we examine the return probability $P(T)$, which is the…