English
Related papers

Related papers: Self-avoiding walk is sub-ballistic

200 papers

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

Probability · Mathematics 2018-03-29 Volker Betz , Lorenzo Taggi

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

Probability · Mathematics 2011-06-21 Francis Comets , Mikhail V. Menshikov , Stanislav Volkov , Andrew R. Wade

We consider a random walk $\tilde S$ which has different increment distributions in positive and negative half-planes. In the upper half-plane the increments are mean-zero i.i.d. with finite variance. In the lower half-plane we consider two…

Probability · Mathematics 2021-11-18 Andrey Pilipenko , Ben Povar

We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…

Statistical Mechanics · Physics 2016-10-06 Nathan Clisby , Andrew R. Conway , Anthony J. Guttmann

We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds to the probability that pairs of…

Statistical Mechanics · Physics 2017-06-28 Nathan Clisby

We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metric). Kesten (1986) famously showed that this is true for the…

Probability · Mathematics 2021-07-23 Shirshendu Ganguly , James R. Lee

We consider random walks on $\Z^d$ among nearest-neighbor random conductances which are i.i.d., positive, bounded uniformly from above but whose support extends all the way to zero. Our focus is on the detailed properties of the paths of…

Probability · Mathematics 2014-10-29 Marek Biskup , Oren Louidor , Alex Rozinov , Alexander Vandenberg-Rodes

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…

Disordered Systems and Neural Networks · Physics 2009-11-13 Viktoria Blavatska , Wolfhard Janke

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

Probability · Mathematics 2007-05-23 Martin T. Barlow

Let $\{X_n\}_{n\in\mathbb{N}}$ be a sequence of i.i.d. random variables in $\mathbb{Z}^d$. Let $S_k=X_1+...+X_k$ and $Y_n(t)$ be the continuous process on $[0,1]$ for which $Y_n(k/n)=S_k/\sqrt{n}$ $k=1,...,n$ and which is linearly…

Probability · Mathematics 2010-09-06 Zsolt Pajor-Gyulai , Domokos Szász

We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched…

Probability · Mathematics 2020-05-18 Amine Asselah , Bruno Schapira

When we want to simulate the realization of a symmetric simple random walk on $\mathbb Z^d$, we use $(2d)$-side fair dice to decide to which neighbor it jumps at each step if $d\geq 2$ or we simply use a fair coin when $d=1$. Assume that…

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

Statistical Mechanics · Physics 2016-05-18 C. R. F. Granzotti , A. S. Martinez , M. A. A. da Silva

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

Probability · Mathematics 2026-05-04 Tuan-Minh Nguyen

This article investigates the behavior of the continuous-time simple random walk on $\mathbb{Z}^d$, $d \geq 3$. We derive an asymptotic lower bound on the principal exponential rate of decay for the probability that the average value over a…

Probability · Mathematics 2025-07-24 Alberto Chiarini , Maximilian Nitzschner

We study downward deviations of the boundary of the range of a transient walk on the Euclidean lattice. We describe the optimal strategy adopted by the walk in order to shrink the boundary of its range. The technics we develop apply equally…

Probability · Mathematics 2018-09-25 Amine Asselah , Bruno Schapira

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

Probability · Mathematics 2012-12-12 Lung-Chi Chen , Rongfeng Sun

We treat three types of measures of the quantum walk (QW) with the spatial perturbation at the origin, which was introduced by [1]: time averaged limit measure, weak limit measure, and stationary measure. From the first two measures, we see…

Quantum Physics · Physics 2013-06-12 Norio Konno , Tomasz Luczak , Etsuo Segawa

We show that the electrical resistance between the origin and generation n of the incipient infinite oriented branching random walk in dimensions d<6 is O(n^{1-alpha}) for some universal constant alpha>0. This answers a question of Barlow,…

Probability · Mathematics 2015-06-15 Antal A. Járai , Asaf Nachmias

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

Combinatorics · Mathematics 2016-08-10 Simão Herdade , Van Vu