Related papers: Moderate deviations for the self-normalized random…

We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

A L\'evy random medium, in a given space, is a random point process where the distances between points, a.k.a. targets, are long-tailed. Random walks visiting the targets of a L\'evy random medium have been used to model many (physical,…

A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutations of the vertices. We prove that on trees the random walk…

In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…

Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…

A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this,…

We study the asymptotic behaviour of additive functionals of random walks in random scenery. We establish bounds for the moments of the local time of the Kesten and Spitzer process.These bounds combined with a previous moment convergence…

We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…

Let $\{X, X_n, n\geq 1\}$ be a sequence of independent identically distributed non-degenerate random variables. Put $S_0=0, S_n = \sum^n_{i=1} X_i$ and $V_n^2=\sum^n_{i=1} X_i^2, n\ge 1.$ A weak convergence theorem is established for the…

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

We determine, to within O(1), the expected minimal position at level n in certain branching random walks. The walks under consideration have displacement vector (v_1,v_2,...), where each v_j is the sum of j independent Exponential(1) random…

In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…

We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…

Let $\xi_1,\xi_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|\xi_1|]=\infty.$ Consider a random walk $S_n=\xi_1+\cdots+\xi_n$, a stopping time $\tau=\min\{n\ge 1: S_n\le 0\}$ and let…

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

Consider a simple random walk on $\mathbb{Z}$ with a random coloring of $\mathbb{Z}$. Look at the sequence of the first $N$ steps taken in the random walk, together with the colors of the visited locations. We call this the record. From the…

We derive an annealed large deviation principle for the normalised local times of a continuous-time random walk among random conductances in a finite domain in $\Z^d$ in the spirit of Donsker-Varadhan \cite{DV75}. We work in the interesting…