Related papers: Poissonization-based collision threshold derivatio…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
We study the mean and variance of the number of self-intersections of the equilateral isotropic random walk in the plane, as well as the corresponding quantities for isotropic equilateral random polygons (random walks conditioned to return…
We prove that an integrated simple random walk, where random walk and integrated random walk are conditioned to return to zero, has asymptotic probability $n^{-1/2}$ to stay positive. This question is motivated by so-called random polymer…
A particle entering a scattering and absorbing medium executes a random walk through a sequence of scattering events. The particle ultimately achieves first-passage, leaving the medium or it is absorbed. The Kubelka-Munk model describes a…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
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…
We present a multiscale analysis for the exit measures from large balls in Z^d, d\geq 3, of random walks in certain i.i.d. random environments which are small perturbations of the fixed environment corresponding to simple random walk. Our…
We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…
The phenomenology of turbulent relative dispersion is revisited. A heuristic scenario is proposed, in which pairs of tracers undergo a succession of independent ballistic separations during time intervals whose lengths fluctuate. This…
We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…
We study the asymptotic probability that a random walk with heavy-tailed increments crosses a high boundary on a random time interval. We use new techniques to extend results of Asmussen [Ann. Appl. Probab. 8 (1998) 354-374] to completely…
Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. Alon, Benjamini,…
In this work we study a natural transition mechanism describing the passage from a quenched (almost sure) regime to an annealed (in average) one, for a symmetric simple random walk on random obstacles on sites having an identical and…
We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
We give a local central limit theorem for simple random walks on Z^d, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramer-Edgeworth expansions for lattice distributions.
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…