Related papers: A self-avoiding walk with attractive interactions
We introduce the pushy random walk, where a walker can push multiple obstacles, thereby penetrating large distances in environments with finite obstacle density. This process provides a minimal model for experimentally observed interactions…
Spider walks are systems of interacting particles. The particles move independently as long as their movement do not violate some given rules describing the relative position of the particles; moves that violate the rules are not realized.…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
Walking is a fundamental activity of human life, not only for moving between places but also for interacting with surrounding environments. While walking to destinations, pedestrians may acquaint themselves with attractions such as…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
In two dimensions polymer collapse has been shown to be complex with multiple low temperature states and multi-critical points. Recently, strong numerical evidence has been provided for a long-standing prediction of universal scaling of…
We consider the continuous time version of the `true' or `myopic' self-avoiding random walk with site repulsion in 1d. The Ray-Knight-type method which was applied to the discrete time and edge repulsion case, is applicable to this model…
We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…
We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…
The Bordelaise philosophy, or rather a juvenile version of it, is used to enumerate self avoiding walks in a $[0,1] \times (- \infty, \infty)$.
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…
We use the lace expansion to give a simple proof that the critical two-point function for weakly self-avoiding walk on $\mathbb{Z}^d$ has decay $|x|^{-(d-2)}$ in dimensions $d>4$. The proof uses elementary Fourier analysis and the…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
Bacterial swarms display intriguing dynamical states like active turbulence. Using a hydrodynamic model we now show that such dense active suspensions manifest super-diffusion, via L\'evy walks, which masquerades as a crossover from…
We have considered the persistence of unvisited sites of a lattice, i.e., the probability $S(t)$ that a site remains unvisited till time $t$ in presence of mutually repulsive random walkers. The dynamics of this system has direct…
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…
Recently Beaton, de Gier and Guttmann proved a conjecture of Batchelor and Yung that the critical fugacity of self-avoiding walks interacting with (alternate) sites on the surface of the honeycomb lattice is $1+\sqrt{2}$. A key identity…
We show that Lagrangian measurements in active turbulence bear imprints of turbulent and anomalous streaky hydrodynamics leading to a self-selection of persistent trajectories - Levy walks - over diffusive ones. This emergent dynamical…
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 use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…