Related papers: Long-range self-avoiding walk converges to alpha-s…
The true self-repelling motion is a continuous-time random process which was introduced by T\'oth and Werner in 1998 to be a limit for the "true" self-avoiding random walk defined by T\'oth in 1995. The construction of the true…
We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…
We construct a coupling between the random walk composed of L\'evy area increments from a $d$-dimensional Brownian motion and a random walk composed of quadratic polynomials of Gaussian random variables. This coupling construction is used…
In this paper, we consider transient subordinate Brownian motion X in R^d, d \geq 1, where the Laplace exponent \phi of the corresponding subordinator satisfies some mild conditions. The scaleinvariant Harnack inequality is proved for X. We…
It is well known (Donsker's Invariance Principle) that the random walk converges to Brownian motion by scaling. In this paper, we will prove that the scaled local time of the $(1,L)-$random walk converges to that of the Brownian motion. The…
We introduce a class of discrete time stationary trawl processes taking real or integer values and written as sums of past values of independent `seed' processes on shrinking intervals (`trawl heights'). Related trawl processes in…
We consider a super-Brownian motion $X$. Its canonical measures can be studied through the path-valued process called the Brownian snake. We obtain the limiting behavior of the volume of the $\epsilon$-neighborhood for the range of the…
We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
In this article subordination of random walks in $R^d$ is considered. We prove that subordination of random walks in the sense of [BSC12] yields the same process as subordination of L\'evy processes (in the sense of Bochner). Furthermore,…
We consider a branching Brownian motion in $\mathbb{R}^2$ in which particles independently diffuse as standard Brownian motions and branch at an inhomogeneous rate $b(\theta)$ which depends only on the angle $\theta$ of the particle. We…
For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d>=3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.
Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…
We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…
This paper proves the long-standing open conjecture rooted in chemical physics (Flory (1949)) that the self-avoiding walk (SAW) in the square lattice has root mean square displacement exponent \nu= 3/4. This value is an instance of the…
The kinetics of annihilating random walks in one dimension, with the half-line x>0 initially filled, is investigated. The survival probability of the nth particle from the interface exhibits power-law decay, S_n(t)~t^{-alpha_n}, with…
In this paper we consider the random walk approximation of the solution of a Markovian BSDE whose terminal condition is a locally H{\"o}lder continuous function of the Brownian motion. We state the rate of the L 2-convergence of the…
We prove that random walks on a family of tilings of d-dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations…
We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…
In this paper we provide an analysis of a mean first passage time problem of a random walker subject to a bi-variate $\alpha$-stable L\'evy type noise from a 2-dimensional disk. For an appropriate choice of parameters the mean first passage…