English
Related papers

Related papers: A self-avoiding walk with attractive interactions

200 papers

We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…

Statistical Mechanics · Physics 2019-08-01 C J Bradly , EJ Janse van Rensburg , A L Owczarek , S G Whittington

The aim of this survey is to explain, in a self-contained and relatively beginner-friendly manner, the lace expansion for the nearest-neighbor models of self-avoiding walk and percolation that converges in all dimensions above 6 and 9,…

Probability · Mathematics 2017-12-18 Satoshi Handa , Yoshinori Kamijima , Akira Sakai

The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…

Statistical Mechanics · Physics 2009-11-07 E. Eisenberg , A. Baram

We consider the critical behaviour of the continuous-time weakly self-avoiding walk with contact self-attraction on $\mathbb{Z}^4$, for sufficiently small attraction. We prove that the susceptibility and correlation length of order $p$ (for…

Mathematical Physics · Physics 2020-04-28 Roland Bauerschmidt , Gordon Slade , Benjamin C. Wallace

We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…

Statistical Mechanics · Physics 2015-04-09 Nathan Clisby

We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…

Statistical Mechanics · Physics 2016-02-17 EJ Janse van Rensburg , SG Whittington

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…

Soft Condensed Matter · Physics 2023-04-14 R. J. Santos Neto , A. A. Costa , P. F. Gomes

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…

Materials Science · Physics 2013-05-29 M. Sato , M. Uwaha , Y. Saito , Y. Hirose

We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…

Probability · Mathematics 2014-04-11 Luca Avena , Erwin Bolthausen , Christine Ritzmann

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the…

Mathematical Physics · Physics 2015-05-30 Nicholas R Beaton , Anthony J Guttmann , Iwan Jensen

We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…

Probability · Mathematics 2022-05-16 Gordon Slade

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),…

Mathematical Physics · Physics 2022-12-23 Anthony J Guttmann , Iwan Jensen , Aleksander L Owczarek

We study a class of $d$-dimensional random walks, including the two-dimensional simple random walk, reweighted by a self-repelling Gibbsian pair potential. We prove lower bounds on the diffusion constant for short-range interactions, and…

Probability · Mathematics 2026-02-17 Tobias Schmidt , Mark Sellke

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…

Statistical Mechanics · Physics 2016-10-27 A Bedini , A L Owczarek , T Prellberg

We consider the phase transition induced by compressing a self-avoiding walk in a slab where the walk is attached to both walls of the slab in two and three dimensions, and the resulting phase once the polymer is compressed. The process of…

Statistical Mechanics · Physics 2025-11-19 C J Bradly , N R Beaton , A L Owczarek

Understanding how simple local interactions give rise to emergent exploration patterns is a fundamental question in statistical physics. We introduce a minimal model of two coupled agents that avoid retracing their own paths while being…

Populations and Evolution · Quantitative Biology 2026-03-24 Nick Dashti , M. N. Najafi , Debra J. Searles

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…

Statistical Mechanics · Physics 2014-09-02 Nicholas R. Beaton

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

Probability · Mathematics 2010-01-13 Remco van der Hofstad , Mark Holmes

We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…

Statistical Mechanics · Physics 2009-10-30 Jae Woo Lee