Related papers: On a Type of Self-Avoiding Random Walk with Multip…
There have been separate studies of the polymer collapse transition, where the collapse was induced by two different types of attraction. In each case, the configurations of the polymer were given by the same subset of random walks being…
We present results from extensive Monte Carlo simulations of polymer models where each lattice site can be visited by up to $K$ monomers and no restriction is imposed on the number of bonds on each lattice edge. These \textit{multiple…
We solve a model of self-avoiding walks with up to two monomers per site on the Bethe lattice. This model, inspired on the Domb-Joyce model, was recently proposed to describe the collapse transition observed in interacting polymers [J.…
The study of the effect of random impurities on the collapse of a flexible polymer in dilute solution has had recent attention with consideration of semi-stiff interacting self-avoiding walks on the square lattice. In the absence of…
We study by computer simulation a recently introduced generalised model of self-interacting self-avoiding trails on the square lattice that distinguishes two topologically different types of self-interaction: namely crossings where 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 solve a model of self-avoiding walks which allows for a site to be visited up to two times by the walk on the Husimi lattice. This model is inspired in the Domb-Joyce model and was proposed to describe the collapse transition of polymers…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…
In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…
We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…
We study self-avoiding walks on the square lattice restricted to a square box of side $L$ weighted by a length fugacity without restriction of their end points. This models a confined polymer in dilute solution. The model admits a phase…
Trails (bond-avoiding walks) provide an alternative lattice model of polymers to self-avoiding walks, and adding self-interaction at multiply visited sites gives a model of polymer collapse. Recently, a two-dimensional model (triangular…
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…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
The conformations of interacting linear polymers on a dynamical planar random lattice are studied using a random two-matrix model. An exact expression for the partition function of self-avoiding chains subject to attractive contact…
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
Self-avoiding walks are a simple and well-known model of long, flexible polymers in a good solvent. Polymers being pulled away from a surface by an external agent can be modelled with self-avoiding walks in a half-space, with a Boltzmann…
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…
Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…