Related papers: On large intersection and self-intersection local …

In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…

This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…

We obtain estimates for large and moderate deviations for the capacity of the range of a random walk on $\mathbb{Z}^d$, in dimension $d\ge 5$, both in the upward and downward directions. The results are analogous to those we obtained for…

The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…

We revisit the problem of estimates of moments of random n-dimensional matrices of Wigner ensemble by using the approach elaborated by Ya. Sinai and A. Soshnikov and further developed by A. Ruzmaikina. Our main subject is given by the…

We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…

We consider weighted geodesic random walks in a complete Riemannian manifold $(M,g)$. We show that for almost all sequences of weights (with respect to a suitable measure), these weighted geodesic random walks satisfy, when suitably scaled,…

The main purpose of this work is to define planar self-intersection local time by an alternative approach which is based on an almost sure pathwise approximation of planar Brownian motion by simple, symmetric random walks. As a result,…

We study some properties of the local time of the asymmetric Bernoulli walk on the line. These properties are very similar to the corresponding ones of the simple symmetric random walks in higher ($d\geq3$) dimension, which we established…

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their…

One-dimensional run-and-tumble processes may converge towards some localized non-equilibrium steady state when the two velocities and/or the two switching rates are space-dependent. A long dynamical trajectory can be then analyzed via the…

We consider a $\mathbb{R}^d$-valued branching random walk with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. With the help of the…

In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…

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…

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ)^d, d >= 3, until u N^d time steps, u > 0, and the model of random interlacements recently introduced by Sznitman. In…

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

In this article, a localisation result is proved for the biased random walk on the range of a simple random walk in high dimensions (d \geq 5). This demonstrates that, unlike in the supercritical percolation setting, a slowdown effect…

We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…