Related papers: Strong renewal theorems and local large deviations…

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…

We study the large deviations of one-dimensional excited random walks. We prove a large deviation principle for both the hitting times and the position of the random walk and give a qualitative description of the respective rate functions.…

We present the first rigorous quantitative analysis of once-reinforced random walks (ORRW) on general graphs, based on a novel change of measure formula.~This enables us to prove large deviations estimates for the range of the walk to have…

We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…

The paper is devoted to an invariance principle for Kemperman's model of oscillating random walk on $\mathbb{Z}$. This result appears as an extension of the invariance principal theorem for classical random walks on $\mathbb{Z}$ or…

A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…

Let $S_{n}=\sum_{k=1}^{n}\xi_{k}$, $n\in\mathbb{N}$, be a standard random walk with i.i.d. nonnegative increments $\xi_{1},\xi_{2},\ldots$ and associated renewal counting process $N(t)=\sum_{n\ge 1}1_{\{S_{n}\le t\}}$, $t\ge 0$. A…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We have extended our method of grouping of Feynman diagrams (GFD theory) to study the transverse (G_t) and longitudinal (G_l) Greens functions in phi^4 model below the critical point (T<T_c) in presence of an infinitesimal external field.…

The study of convolution powers of a finitely supported probability distribution $\phi$ on the $d$-dimensional square lattice is central to random walk theory. For instance, the $n$th convolution power $\phi^{(n)}$ is the distribution of…

We study the gambler's ruin problem for a biased random walk on $\{0,1,\dots,a\}$ under multi-site geometric resetting: at each time step, the walker is reset with probability $\gamma\in(0,1)$ to a random position drawn from a distribution…

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…

This work is a continuation of [7]. We consider a continuous-time birth-and-death process in which the transition rates have an asymptotical power-law dependence upon the position of the process. We establish rough exponential asymptotic…

Let $(X,d)$ be a geodesic Gromov-hyperbolic space, $o \in X$ a basepoint and $\mu$ a countably supported non-elementary probability measure on $\operatorname{Isom}(X)$. Denote by $z_n$ the random walk on $X$ driven by the probability…

We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…

Several stochastic processes modeling molecular motors on a linear track are given by random walks (not necessarily Markovian) on quasi 1d lattices and share a common regenerative structure. Analyzing this abstract common structure, we…

Let $F$ be a distribution function on the integer lattice $\mathbb{Z}$ and $S=(S_n)$ the random walk with step distribution $F$. Suppose $S$ is oscillatory and denote by $U_{\rm a}(x)$ and $u_{\rm a}(x)$ the renewal function and sequence,…

A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…

We consider a random walk on $\R^d$ in a polynomially mixing random environment that is refreshed at each time step. We use a martingale approach to give a necessary and sufficient condition for the almost-sure functional central limit…

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…