Related papers: Off-lattice Monte Carlo Simulation of Supramolecul…
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…
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…
We present a method to generate realistic, three-dimensional networks of crosslinked semiflexible polymers. The free energy of these networks is obtained from the force-extension characteristics of the individual polymers and their…
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…
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 use Monte Carlo simulations to study polymer melts consisting of fully flexible and moderately stiff chains in the bond fluctuation model at a volume fraction $0.5$. In order to reduce the local density fluctuations, we test a…
Single linear polymer chains in dilute solutions under good solvent conditions are studied by Monte Carlo simulations with the pruned-enriched Rosenbluth method up to the chain length $N \sim {\cal O}(10^4)$. Based on the standard simple…
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…
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…
We present a lattice Monte Carlo simulation for a multiblock copolymer chain of length N=240 and microarchitecture $(10-10)_{12}$.The simulation was performed using the Monte Carlo method with the Metropolis algorithm. We measured average…
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…
Obtaining reliable estimates of the statistical properties of complex macromolecules by computer simulation is a task that requires high computational effort as well as the development of highly efficient simulation algorithms. We present…
The persistence length of macromolecules is one of their basic characteristics, describing their intrinsic local stiffness. However, it is difficult to extract this length from physical properties of the polymers, different recipes may give…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
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…
An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…
We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of…
The structure of a polystyrene matrix filled with tightly cross-linked polystyrene nanoparticles, forming an athermal nanocomposite system, is investigated by means of a Monte Carlo sampling formalism. The polymer chains are represented as…
We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…
The effect of different Monte Carlo move sets on the the folding kinetics of lattice polymer chains is studied from the geometry of the conformation-network. The networks have the characteristics of small- world. The Monte Carlo move, rigid…