Related papers: Two-dimensional oriented self-avoiding walks with …
We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…
The exact grand-canonical solution of a generalized interacting self-avoid walk (ISAW) model, placed on a Husimi lattice built with squares, is presented. In this model, beyond the traditional interaction $\omega_1=e^{\epsilon_1/k_B T}$…
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…
We consider an off-lattice liquid crystal pair potential in strictly two dimensions. The potential is purely repulsive and short-ranged. Nevertheless, by means of a single parameter in the potential, the system is shown to undergo a…
These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the…
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71.…
How long does a self-avoiding walk on a discrete $d$-dimensional torus have to be before it begins to behave differently from a self-avoiding walk on $\mathbb{Z}^d$? We consider a version of this question for weakly self-avoiding walk on a…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
We study the two-species symbiotic contact process (2SCP), recently proposed in [de Oliveira, Santos and Dickman, Phys. Rev. E {\bf 86}, 011121 (2012)] . In this model, each site of a lattice may be vacant or host single individuals of…
With a Si(001) vicinal surface in mind, we study step wandering instability on a vicinal surface with an anisotropic surface diffusion whose orientation dependence alternates on each consecutive terrace. In a conserved system step wandering…
We present the first rigorous quantitative analysis of once-reinforced random walks (ORRW) on general graphs, based on a novel change of measure formula.~This enables us to prove large deviations estimates for the range of the walk to have…
Monte Carlo simulations of a Miyazawa-Jernigan lattice-polymer model indicate that, depending on the native's structure geometry, the model exhibits two broad classes of folding mechanisms for two-state folders. Folding to native structures…
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…
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
The critical adsorption point (CAP) of self-avoiding walks (SAW) interacting with a planar surface with surface disorder or sequence disorder has been studied. We present theoretical equations, based on ones previously developed by Soteros…
A two-dimensional square-lattice model for the formation of secondary structures in proteins, the hydrogen-bonding model, is extended to include the effects of solvent quality. This is achieved by allowing configuration-dependent…
We have studied the phase transition of the contact process near a multiple junction of $M$ semi-infinite chains by Monte Carlo simulations. As opposed to the continuous transitions of the translationally invariant ($M=2$) and semi-infinite…
A generalised model for interacting self-avoiding trails on the square lattice is presented and studied using numerical transfer matrix methods. The model differentiates between on-site double visits corresponding to collisions, and…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…