Related papers: End-to-end Distance from the Green's Function for …
We study the lattice Green's function (LGF) of the screened Poisson equation on a two-dimensional rectangular lattice. This LGF arises in numerical analysis, random walks, solid-state physics, and other fields. Its defining characteristic…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
We prove $|x|^{-2}$ decay of the critical two-point function for the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the upper critical dimension $d=4$. This is a statement that the critical exponent $\eta$ exists and is…
We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…
We study the correction-to-scaling exponents for the two-dimensional self-avoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-avoiding walks up to 59 steps on the square lattice, and up…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…
We calculate the resistance between two arbitrary grid points of several infinite lattice structures of resistors by using lattice Green's functions. The resistance for $d$ dimensional hypercubic, rectangular, triangular and honeycomb…
We consider a particle performing a stochastic motion on a one-dimensional lattice with jump widths distributed according to a power-law with exponent $\mu + 1$. Assuming that the walker moves in the presence of a distribution $a(x)$ of…
We identify a single computationally checkable analytic quantity interlacing Martin boundary collapse, Green geometry, and linear escape for transient random walks on finitely generated groups: the Green-variation functional \[…
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…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
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…
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
The Levy walk in which the frequency of occurrence of step lengths follows a power-law distribution, can be observed in the migratory behavior of organisms at various levels. Levy walks with power exponents close to 2 are observed, and the…
As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…
We consider the $n$-component $|\varphi|^4$ lattice spin model ($n \ge 1$) and the weakly self-avoiding walk ($n=0$) on $\mathbb{Z}^d$, in dimensions $d=1,2,3$. We study long-range models based on the fractional Laplacian, with spin-spin…