Related papers: Self avoiding walk on the seven regular triangulat…

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

We prove a sharp estimate on the expected value of the integral of the index of a simple random walk on the square or triangular lattice. This gives new lower bounds on the averaged Dehn function, which measures the expected area needed to…

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…

Excited random walk is a process that has a drift to the right whenever it encounters a new vertex. The paper shows that in two dimensions it drifts to the right linearly in time.

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We prove that a uniform infinite quadrangulation of the half-plane decorated by a self-avoiding walk (SAW) converges in the scaling limit to the metric gluing of two independent Brownian half-planes identified along their positive boundary…

We consider a multi-walker generalization of the true self-avoiding walk: the bricklayer model. We perform stochastic simulations, and solve the partial differential equations that describe the collective motion of $N$ bricklayers/walkers…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

We investigate the large-scale behaviour of the Self-Repelling Brownian Polymer (SRBP) in the critical dimension $d=2$. The SRBP is a model of self-repelling motion, which is formally given by the solution a stochastic differential equation…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

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

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…

We provide numerical support for a long-standing prediction of universal scaling of winding angle distributions. Simulations of interacting self-avoiding walks show that the winding angle distribution for $N$-step walks is compatible with…

We show that a random walk on the mapping class group of an orientable surface of finite type makes linear progress in the relative metric, which is quasi-isometric to the complex of curves.

The trajectories of microswimmers moving in narrow channels of widths comparable to their sizes are significantly altered when they encounter another microswimmer moving in the opposite direction. The consequence of these encounters is a…

We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…

We analyse the equilibrium pile-up configurations of infinite periodic walls of edge dislocations which are forced against an impenetrable obstacle by a constant applied shear stress. Numerically generated density distributions exhibit two…

We consider localization of a random walk (RW) when attracted or repelled by multiple extended manifolds of different dimensionalities. In particular, we focus on $(d-1)$- and $(d-2)$-dimensional manifolds in $d$-dimensional space, where…