Related papers: Large deviations for random walks on free products…

We extend classical results by A. V. Nagaev [Izv. Akad. Nauk UzSSR Ser. Fiz.--Mat. Nauk 6 (1969) 17--22, Theory Probab. Appl. 14 (1969) 51--64, 193--208] on large deviations for sums of i.i.d. regularly varying random variables to partial…

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched…

We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving cut-off boundary at location n. Conditional on the sum being large at scale n, we show that a finite number of…

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 consider a discrete-time continuous-space random walk under the constraints that the number of returns to the origin (local time) and the total area under the walk are fixed. We first compute the joint probability of an excursion having…

We provide a new derivation of the well-known generating function counting the number of walks on a regular tree that start and end at the same vertex, and more generally, a generating function for the number of walks that end at a vertex a…

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…

Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

We consider a discrete-time random walk on a one-dimensional lattice with space and time-dependent random jump probabilities, known as the Beta random walk. We are interested in the probability that, for a given realization of the jump…

We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of…

A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…

We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…

We prove a Large Deviations Principle for the number of intersections of two independent infinite-time ranges in dimension five and more, improving upon the moment bounds of Khanin, Mazel, Shlosman and Sina{\"i} [KMSS94]. This settles, in…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

In this paper we consider random walks on Galton-Watson trees with random conductances. On these trees, the distance of the walker to the root satisfies a law of large numbers with limit the effective velocity, or speed of the walk. We…

We establish the discrete approximation to Brownian motion with varying dimension (BMVD in abbreviation) by random walks. The setting is very similar to that in [11], but here we use a different method allowing us to get rid the…