English
Related papers

Related papers: Self-avoiding walk is sub-ballistic

200 papers

We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…

Statistical Mechanics · Physics 2009-10-31 D. Bennett-Wood , J. L. Cardy , I. G. Enting , A. J. Guttmann , A. L. Owczarek

This article proposes a new way of deriving mean-field exponents for the weakly self-avoiding walk model in dimensions $d>4$. Among other results, we obtain up-to-constant estimates for the full-space and half-space two-point functions in…

Probability · Mathematics 2025-07-28 Hugo Duminil-Copin , Romain Panis

We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…

Probability · Mathematics 2016-06-22 Ariel Yadin

We study the once-reinforced random walk on $\mathbb Z^d$, which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that the walk is transient when $d\ge 6$ and when the reinforcement…

Probability · Mathematics 2026-01-27 Dor Elboim , Gady Kozma

We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…

Probability · Mathematics 2022-05-10 Adam M. Bowditch , David A. Croydon

We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…

Probability · Mathematics 2019-10-23 David Croydon , Mark Holmes

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…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh

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…

Biomolecules · Quantitative Biology 2013-06-19 Jacques M. Bahi , Christophe Guyeux , Kamel Mazouzi , Laurent Philippe

This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…

Combinatorics · Mathematics 2011-04-08 Martin Klazar

We consider $d$ independent walkers in the same random environment in $\mathbb{Z}$. Our assumption on the law of the environment is such that a single walker is transient to the right but subballistic. We show that - no matter what $d$ is -…

Probability · Mathematics 2019-09-04 Alexis Devulder , Nina Gantert , Françoise Pene

We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…

Mathematical Physics · Physics 2021-12-20 Nicholas R. Beaton , Anthony J. Guttmann , Iwan Jensen , Gregory F. Lawler

We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of…

Statistical Mechanics · Physics 2017-01-03 Hao Hu , Xiaosong Chen , Youjin Deng

Self-attractive random walks undergo a phase transition in terms of the applied drift: If the drift is strong enough, then the walk is ballistic, whereas in the case of small drifts self-attraction wins and the walk is sub-ballistic. We…

Probability · Mathematics 2015-03-19 Dmitry Ioffe , Yvan Velenik

In this paper we investigate a problem about certain walks in the ring of Gaussian integers. Let $n,d$ be two natural numbers. Does there exist a sequence of Gaussian integers $z_j$ such that $|z_{j+1}-z_j|=1$ and a pair of indices $r$ and…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu , Ram Krishna Pandey

Let $\mu$ be the self-avoiding walk connective constant on $\ZZ^d$. We show that the asymptotic expansion for $\beta_c=1/\mu$ in powers of $1/(2d)$ satisfies Borel type bounds. This supports the conjecture that the expansion is Borel…

Probability · Mathematics 2015-05-14 B. T. Graham

We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…

Probability · Mathematics 2021-03-05 Ryoki Fukushima , Alejandro F. Ramírez

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 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

Consider a random walk in a uniformly elliptic i.i.d. random environment in dimensions $d\ge 2$. In 2002, Sznitman introduced for each $\gamma\in (0,1)$ the ballisticity conditions $(T)_\gamma$ and $(T'),$ the latter being defined as the…

Probability · Mathematics 2009-03-27 Alexander Drewitz , Alejandro F. Ramírez

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…

Statistical Mechanics · Physics 2015-06-22 Nicholas R. Beaton