Related papers: Self-avoiding trails with nearest neighbour intera…
Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…
A phase diagram for a surface-interacting long flexible polymer chain in a two-dimensional poor solvent where the possibility of collapse exists is determined using exact enumeration method. A model of a self-attracting self avoiding walk…
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…
We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…
Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…
Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…
The phase diagram and surface critical behaviour of the vertex-interacting self-avoiding walk are examined using transfer matrix methods extended using DMRG and coupled with finite-size scaling. Particular attention is paid to the critical…
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
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…
We consider a self-avoiding walk model (SAW) on the faces of the square lattice $\mathbb{Z}^2$. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square…
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…
Understanding the role of self-propulsion on the conformational properties of active filamentous objects has relevance in biology. In this context, we consider a flexible bead-spring model polymer for which along with both attractive and…
Pedestrian groups are commonly found in crowds but research on their social aspects is comparatively lacking. To fill that void in literature, we study the dynamics of collision avoidance between pedestrian groups (in particular dyads) and…
We use complete enumeration and Monte Carlo techniques to study two-dimensional self-avoiding polymer chains with quenched ``charges'' $\pm 1$. The interaction of charges at neighboring lattice sites is described by $q_i q_j$. We find that…
In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…
We introduce branching annihilating attracting walk (BAAW) in one dimension. The attracting walk is implemented by a biased hopping in such a way that a particle prefers hopping to a nearest neighbor located on the side where the nearest…
A recently introduced extension of the Corner Transfer Matrix Renormalisation Group (CTMRG) method useful for the study of self-avoiding walk type models is presented in detail and applied to a class of interacting self-avoiding walks due…
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…
In the present paper, we investigate the collapsed phase of the interacting partially-directed self-avoiding walk (IPDSAW) that was introduced in Zwanzig and Lauritzen (1968). We provide sharp asymptotics of the partition function inside…
We study the collapse transition of a polymer on a square lattice with both nearest-neighbor and next nearest-neighbor interactions, by calculating the exact partition function zeros up to chain length 36. The transition behavior is much…