Related papers: The loop-erased random walk and the uniform spanni…

We prove a weak law of large numbers for the capacity of the range of simple random walks on $\mathbb{Z}^{4}$. On $\mathbb{Z}^{3}$, we show that the capacity, properly scaled, converges in distribution towards the corresponding quantity for…

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random…

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…

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…

Two-dimensional loop-erased random walks (LERWs) are random planar curves whose scaling limit is known to be a Schramm-Loewner evolution SLE_k with parameter k = 2. In this note, some properties of an SLE_k trace on doubly-connected domains…

This work proves that the fluctuations of the cover time of simple random walk in the discrete torus of dimension at least three with large side-length are governed by the Gumbel extreme value distribution. This result was conjectured for…

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

Rotor walk is deterministic counterpart of random walk on graphs. We study that under a certain initial configuration in Z^d, n particles perform rotor walks from the origin consecutively. They would stop if they hit the origin or infinity.…

By computations on generating functions, Szekeres proved in 1983 that the law of the diameter of a uniformly distributed rooted labelled tree with n vertices, rescaled by a factor n^{1/2} , converges to a distribution whose density is…

We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…

We prove limit theorems for random walks with $n$ steps in the $d$-dimensional Euclidean space as both $n$ and $d$ tend to infinity. One of our results states that the path of such a random walk, viewed as a compact subset of the…

We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…

We study the boundary of the range of simple random walk on $\mathbb{Z}^d$ in the transient regime $d\ge 3$. We show that volumes of the range and its boundary differ mainly by a martingale. As a consequence, we obtain a bound on the…

For a simple (unbiased) random walk on a connected graph with $n$ vertices, the cover time (the expected number of steps it takes to visit all vertices) is at most $O(n^3)$. We consider locally biased random walks, in which the probability…

We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…

We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…

We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…