相关论文: A new monte carlo algorithm for growing compact Se…

We demonstrate that the recently proposed interacting growth walk (IGW) model, modified for generating self-avoiding heteropolymers, proves to be a simpler alternative to the other Monte Carlo methods available in the literature for…

The Interacting Growth Walk (IGW) is a kinetic algorithm proposed recently for generating long, compact, self avoiding walks. The growth process in IGW is tuned by the so called growth temperature $T' = 1/(k_B \beta ')$. On a square lattice…

We show that the compact self avoiding walk configurations, kinetically generated by the recently introduced Interacting Growth Walk (IGW) model, can be considered as members of a canonical ensemble if they are assigned random values of…

We have explained in detail why the canonical partition function of Interacting Self Avoiding Walk (ISAW), is exactly equivalent to the configurational average of the weights associated with growth walks, such as the Interacting Growth Walk…

We show that the Density of States (DoS) for lattice Self Avoiding Walks can be estimated by using an inverse algorithm, called flatIGW, whose step-growth rules are dynamically adjusted by requiring the energy histogram to be locally flat.…

Interacting Growth Walks is a recently proposed stochastic model for studying the coil-globule transition of linear polymers. We propose a flat energy histogram version for Interacting Growth Walk. We demonstrate the algorithm on two…

This article is dedicated to the study of the 2-dimensional interacting prudent self-avoiding walk (referred to by the acronym IPSAW) and in particular to its collapse transition. The interaction intensity is denoted by $\beta>0$ and the…

The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…

We have investigated a polymer growth process on the triangular lattice where the configurations produced are self-avoiding trails. We show that the scaling behaviour of this process is similar to the analogous process on the square…

This paper is dedicated to the investigation of a $1+1$ dimensional self-interacting and partially directed self-avoiding walk, usually referred to by the acronym IPDSAW and introduced in \cite{ZL68} by Zwanzig and Lauritzen to study the…

We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and ``cut-and-permute'' moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot…

We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…

We study a generalized interacting self-avoiding walk (ISAW) model with nearest- and next nearest-neighbor (NN and NNN) interactions on the square and cubic lattices. In both dimensions, the phase diagrams show coil and globule phases…

The self-avoid random walk algorithm has been extensively used in the study of polymers. In this work we study the basic properties of the trajectories generated with this algorithm when two interactions are added to it: contact and folding…

We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…

Monte Carlo simulations, using the PERM algorithm, of interacting self-avoiding walks (ISAW) and interacting self-avoiding trails (ISAT) in five dimensions are presented which locate the collapse phase transition in those models. It is…

The jump-walking Monte-Carlo algorithm is revisited and updated to study the equilibrium properties of systems exhibiting quasi-ergodicity. It is designed for a single processing thread as opposed to currently predominant algorithms for…

We use complete enumeration and Monte Carlo techniques to study self--avoiding walks with random nearest--neighbor interactions described by $v_0q_iq_j$, where $q_i=\pm1$ is a quenched sequence of ``charges'' on the chain. For equal numbers…

We investigate, by series methods, the behaviour of interacting self-avoiding walks (ISAWs) on the honeycomb lattice and on the square lattice. This is the first such investigation of ISAWs on the honeycomb lattice. We have generated data…

The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures…