English
Related papers

Related papers: Invariance principles for random walks conditioned…

200 papers

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

Probability · Mathematics 2015-09-29 Yueyun Hu , Zhan Shi

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…

Probability · Mathematics 2011-12-06 Nadine Guillotin-Plantard , Françoise Pène

We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…

Probability · Mathematics 2024-11-12 Jean-Dominique Deuschel , Martin Slowik , Weile Weng

Let $S_n$ be a centered random walk with a finite variance, and define the new sequence $A_n:=\sum_{i=1}^n S_i$, which we call an integrated random walk. We are interested in the asymptotics of $$p_N:=P(\min_{1 \le k \le N} A_k \ge 0)$$ as…

Probability · Mathematics 2010-05-06 Vladislav Vysotsky

Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…

Probability · Mathematics 2022-10-19 Marco Bertenghi , Alejandro Rosales-Ortiz

Let (S_n)_{n\in\N} be a Z-valued random walk with increments from the domain of attraction of some \alpha-stable law and let (\xi(i))_{i\in\Z} be a sequence of iid random variables. We want to investigate U-statistics indexed by the random…

Probability · Mathematics 2015-03-04 Brice Franke , Francoise Pene , Martin Wendler

We construct the law of L\'{e}vy processes conditioned to stay positive under general hypotheses. We obtain a Williams type path decomposition at the minimum of these processes. This result is then applied to prove the weak convergence of…

Probability · Mathematics 2016-08-16 Loïc Chaumont , Ron A. Doney

We prove that every random walk in i.i.d. environment in dimension greater than or equal to 2 that has an almost sure positive speed in a certain direction, an annealed invariance principle and some mild integrability condition for…

Probability · Mathematics 2008-01-05 Noam Berger , Ofer Zeitouni

We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…

Probability · Mathematics 2012-04-12 Olivier Raimond , Bruno Schapira

We establish annealed and quenched invariance principles for random walks in random conductances lifted to the p-variation rough path topology, allowing for degenerate environments and long-range jumps. Our proof is based on a unified…

Probability · Mathematics 2026-04-17 Johannes Bäumler , Noam Berger , Tal Orenshtein , Martin Slowik

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…

Probability · Mathematics 2023-11-28 Zhishui Hu , Yiting Zhang

We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a…

Probability · Mathematics 2017-01-24 Kohei Uchiyama

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

Probability · Mathematics 2018-08-07 Kohei Uchiyama

We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…

Probability · Mathematics 2015-05-13 Firas Rassoul-Agha , Timo Seppalainen

We consider a random walk X_n in non-i.i.d. environment and show that the ratio of log X_n to log n converges in probability to a positive constant.

Probability · Mathematics 2007-05-23 Alexander Roitershtein

We consider a discrete time random walk in a space-time i.i.d. random environment. We use a martingale approach to show that the walk is diffusive in almost every fixed environment. We improve on existing results by proving an invariance…

Probability · Mathematics 2007-05-23 F. Rassoul-Agha , T. Seppalainen

We consider the random conductance model in a stationary and ergodic environment. Under suitable moment conditions on the conductances and their inverse, we prove a quenched invariance principle for the random walk among the random…

Probability · Mathematics 2019-02-18 Peter Bella , Mathias Schäffner

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

Probability · Mathematics 2014-09-29 Nadine Guillotin-Plantard , Julien Poisat

We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being…

Probability · Mathematics 2019-06-04 Hoang-Long Ngo , Marc Peigne

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Probability · Mathematics 2012-10-08 Christophe Gallesco , Serguei Popov