Related papers: Adsorbed self-avoiding walks pulled at an interior…
Polymer chains undergoing a continuous adsorption-desorption transition are studied through extensive computer simulations. A three-dimensional self-avoiding walk lattice model of a polymer chain grafted onto a surface has been treated for…
We study several models of staircase polygons on the $45^\circ$ rotated square lattice, which interact with an impenetrable surface while also being pushed towards or pulled away from the surface by a force. The surface interaction is…
The phase structure of self-avoiding polymerized membranes is studied by extensive Hybrid Monte Carlo simulations. Several folding transitions from the flat to a collapsed state are found. Using a suitable order parameter and finite size…
This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We study the adsorption-desorption of fluid molecules on a solid substrate by introducing a schematic model in which the adsorption/desorption transition probabilities are given by irreversible kinetic constraints with a tunable violation…
We study an active random walker model in which a particle's motion is determined by a self-generated field. The field encodes information about the particle's path history. This leads to either self-attractive or self-repelling behavior.…
Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…
Linear polymers adsorbing on a wall can be modelled by half-space self-avoiding walks adsorbing on a line in the square lattice, or on a surface in the cubic lattice. In this paper a numerical approach based on the GAS algorithm is used to…
We consider the properties of a self-avoiding polymer chain, adsorbed on a solid attractive substrate which is attached with one end to a pulling force. The conformational properties of such chain and its phase behavior are treated within a…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
In the present paper, we consider the interacting partially-directed self-avoiding walk (IPDSAW) attracted by a vertical wall. The IPDSAW was introduced by Zwanzig and Lauritzen (J. Chem. Phys., 1968) as a manner of investigating the…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
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 an analysis of a partially directed walk model of a polymer which at one end is tethered to a sticky surface and at the other end is subjected to a pulling force at fixed angle away from the point of tethering. Using the kernel…
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
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…