Related papers: A note on the intersections of two random walks in…
The quenched and annealed large deviations of the random walk in random environment are shown to conform on any compact set whenever the level of disorder is sufficiently low. In this work, we show that these two large deviations always…
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…
We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
We define a dynamical simple symmetric random walk in one dimension, and show that there almost surely exist exceptional times at which the walk tends to infinity. This is in contrast to the usual dynamical simple symmetric random walk in…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without 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…
The quantum walk differs fundamentally from the classical random walk in a number of ways, including its linear spreading and initial condition dependent asymmetries. Using stationary phase approximations, precise asymptotics have been…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Let $(X_t,t\geq 0)$ be a random walk on $\mathbb{Z}^d$. Let $ l_T(x)= \int_0^T \delta_x(X_s)ds$ the local time at the state $x$ and $ I_T= \sum\limits_{x\in\mathbb{Z}^d} l_T(x)^q $ the q-fold self-intersection local time (SILT). In…
We consider the range of the simple random walk on graphs with spectral dimension two. We give a form of strong law of large numbers under a certain uniform condition, which is satisfied by not only the square integer lattice but also a…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
Lecture notes of a master course given at Orsay between 2019-2024. Topics covered include Part I: One-dimensional random walks, cycle lemma and Bienaym\'e--Galton--Watson random trees. Part II: Erd\"os--R\'enyi random graphs, three proofs…
This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…