Related papers: Growth exponent for loop-erased random walk in thr…
We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…
We formulate a compounded random walk that is physically well defined on both finite and infinite domains, and samples space-dependent forces throughout jumps. The governing evolution equation for the walk limits to a space-fractional…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…
We prove that the edge-reinforced random walk on the ladder ${\mathbb{Z}\times\{1,2\}}$ with initial weights $a>3/4$ is recurrent. The proof uses a known representation of the edge-reinforced random walk on a finite piece of the ladder as a…
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 show that a random 3-manifold with positive first Betti number admits a tower of cyclic covers with exponential torsion growth.
We consider the simple random walk on $\mathbb{Z}^d$ evolving in a random i.i.d. potential taking values in $[0,+\infty)$. The potential is not assumed integrable, and can be rescaled by a multiplicative factor $\lambda > 0$. Completing the…
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a…
We prove the law of the iterated logarithm for discrepancies of the sequence $\{(3/2)^kx\}$.
We prove distributional limit theorems for the length of the largest convex minorant of a one-dimensional random walk with independent identically distributed increments. Depending on the increment law, there are several regimes with…
We show that the `erasing-larger-loops-first' (ELLF) method, which was first introduced for erasing loops from the simple random walk on the Sierpinski gasket, does work also for non-Markov random walks, in particular, self-repelling walks…
Using a connection between the $q$-oscillator algebra and the coefficients of the high temperature expansion of the frustrated Gaussian spin model, we derive an exact formula for the number of closed random walks of given length and area,…
We introduce the notion of \emph{localization at the boundary} for conditioned random walks in i.i.d. and uniformly elliptic random environment on $\mathbb{Z}^d$, in dimensions two and higher. Informally, this means that the walk spends a…
Active walker models have proved to be extremely effective in understanding the evolution of a large class of systems in biology like ant trail formation and pedestrian trails. We propose a simple model of a random walker which modifies its…
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…
We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…