Related papers: Loop-erased random walk on the Sierpinski gasket

We study the condensation regime of the finite reversible inclusion process, i.e., the inclusion process on a finite graph $S$ with an underlying random walk that admits a reversible measure. We assume that the random walk kernel is…

Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according…

Let \alpha ([0,1]^p) denote the intersection local time of p independent d-dimensional Brownian motions running up to the time 1. Under the conditions p(d-2)<d and d\ge 2, we prove lim_{t\to\infty}t^{-1}\log P\bigl{\alpha([0,1]^p)\ge…

The radial probability measures on $R^p$ are in a one-to-one correspondence with probability measures on $[0,\infty[$ by taking images of measures w.r.t. the Euclidean norm mapping. For fixed $\nu\in M^1([0,\infty[)$ and each dimension p,…

We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

A method is established which allows the calculation of the walk dimension for Sierpinski-type multifractals. The multifractal scaling behaviour of the average time needed to cover a distance in the mentionned multifractals is shown. For…

It has been shown recently that a specific class of path-dependent stochastic processes, which reduce their sample space as they unfold, lead to exact scaling laws in frequency and rank distributions. Such Sample Space Reducing processes…

We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…

We show that in the loop-erased random walk problem, the exponent characterizing probability distribution of areas of erased loops is superuniversal. In d-dimensions, the probability that the erased loop has an area A varies as A^{-2} for…

We prove strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. It is also shown that their local times are close enough to…

We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…

In this paper, we study the overlap distribution and Gibbs measure of the Branching Random Walk with Gaussian increments on a binary tree. We first prove that the Branching Random Walk is 1 step Replica Symmetry Breaking and give a precise…

We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…

We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…

We prove a strong law of large numbers and an annealed invariance principle for a random walk in a one-dimensional dynamic random environment evolving as the simple exclusion process with jump parameter $\gamma$. First, we establish that if…

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.…

The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…