English
Related papers

Related papers: Almost Sure Invariance Principle for Continuous-Sp…

200 papers

We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…

Probability · Mathematics 2013-05-30 Dainius Dzindzalieta

We consider an i.i.d. random environment with a strong form of transience on the two dimensional integer lattice. Namely, the walk always moves forward in the y-direction. We prove a functional CLT for the quenched expected position of the…

Probability · Mathematics 2008-09-03 Mathew Joseph

In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…

Probability · Mathematics 2013-04-17 Magda Peligrad

We consider simple random walks on Delaunay triangulations generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on the point processes, we show that the random walk satisfies an almost sure (or quenched) invariance…

Probability · Mathematics 2014-12-17 Arnaud Rousselle

The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…

Probability · Mathematics 2010-08-10 Balazs Szekely , Tamas Szabados

We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…

Probability · Mathematics 2025-03-04 Alessandra Bianchi , Marco Lenci , Françoise Pène

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Probability · Mathematics 2011-09-02 Gabriel Faraud

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Probability · Mathematics 2025-09-30 George Andriopoulos

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 obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…

Probability · Mathematics 2016-06-09 Irene Crimaldi , Paolo Dai Pra , Pierre-Yves Louis , Ida Germana Minelli

We prove a quenched almost sure invariance principle for certain classes of random distance expanding dynamical systems which do not necessarily exhibit uniform decay of correlations.

Dynamical Systems · Mathematics 2020-09-14 Davor Dragicevic , Yeor Hafouta

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

Probability · Mathematics 2007-05-23 Nathanaël Enriquez , Christophe Sabot

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Probability · Mathematics 2014-04-28 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

Extending our own and others' earlier approaches to reasoning about termination of probabilistic programs, we propose and prove a new rule for termination with probability one, also known as "almost-certain termination". The rule uses both…

Logic in Computer Science · Computer Science 2017-01-09 Annabelle McIver , Carroll Morgan

The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…

Probability · Mathematics 2023-06-21 Bernard Bercu , Víctor Hugo Vázquez Guevara

Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…

Probability · Mathematics 2024-11-22 Stein Andreas Bethuelsen , Florian Völlering

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

Probability · Mathematics 2013-03-07 Mikko Stenlund

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for…

Probability · Mathematics 2016-11-25 Mark Holmes , Rongfeng Sun

The purpose of this article is to construct a toolbox, in Dynamical Systems, to support the idea that ``whenever we can prove a limit theorem in the classical sense for a dynamical system, we can prove a suitable almost-sure version based…

Dynamical Systems · Mathematics 2007-05-23 J-R Chazottes , S Gouezel

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi