English
Related papers

Related papers: Valleys and the maximum local time for random walk…

200 papers

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

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

Probability · Mathematics 2012-02-16 Fabienne Castell , Nadine Guillotin--Plantard , Françoise Pène , Bruno Schapira

We study nearest neighbor random walks on fixed environments of $\mathbb{Z}$ composed of two point types : $(1/2,1/2)$ and $(p,1-p)$ for $p>1/2$. We show that for every environment with density of $p$ drifts bounded by $\lambda$ we have…

Probability · Mathematics 2015-08-31 Eviatar B. Procaccia , Ron Rosenthal

We investigate the minimal local time $f(n)$ of a one-dimensional simple random walk up to time $n$, defined as the smallest number of visits to any site in the range. A conjecture formulated repeatedly by Erd\H{o}s and R\'{e}v\'{e}sz…

Probability · Mathematics 2025-09-25 Chenxu Feng , Chenxu Hao

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

Probability · Mathematics 2008-05-07 Mathias Becker , Wolfgang Konig

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 assume here that their distributions…

Probability · Mathematics 2010-02-10 Fabienne Castell , Nadine Guillotin-Plantard , Françoise Pène , Bruno Schapira

We consider Sinai's random walk in random environment. We prove that for an interval of time [1,n] Sinai's walk sojourns in a small neighborhood of the point of localization for the quasi totality of this amount of time. Moreover the local…

Probability · Mathematics 2007-05-23 Pierre Andreoletti

Let $\xi_1,\xi_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|\xi_1|]=\infty.$ Consider a random walk $S_n=\xi_1+\cdots+\xi_n$, a stopping time $\tau=\min\{n\ge 1: S_n\le 0\}$ and let…

Probability · Mathematics 2019-07-23 Denis Denisov

We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…

Probability · Mathematics 2015-07-29 Anna De Masi , Errico Presutti , Dimitrios Tsagkarogiannis , Maria Eulalia Vares

We consider a one-dimensional diffusion in a stable L\'evy environment. We show that the normalized local time process refocused at the bottom of the standard valley with height $\log t$, $(L_X(t,\mathfrak m_{\log t}+x)/t,x\in \R)$,…

Probability · Mathematics 2010-08-06 Roland Diel , Guillaume Voisin

For a random walk $S_n, n\geq 0$ in $\mathbb{Z}^d$, let $l(n,x)$ be its local time at the site $x\in \mathbb{Z}^d$. Define the $\alpha$-fold self intersection local time $L_n(\alpha) := \sum_{x} l(n,x)^{\alpha}$, and let…

Probability · Mathematics 2015-06-04 George Deligiannidis , Sergey Utev

We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the - suitably centered - empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution…

Probability · Mathematics 2009-02-26 Nina Gantert , Yuval Peres , Zhan Shi

Sinai's walk is a recurrent one-dimensional nearest-neighbor random walk in random environment. It is known for a phenomenon of strong localization, namely, the walk spends almost all time at or near the bottom of deep valleys of the…

Probability · Mathematics 2011-11-09 Zhan Shi , Olivier Zindy

Let S_0=0,{S_n, n>0} be a random walk generated by a sequence of i.i.d. random variables X_1,X_2,... and let \tau^{-} be the first descending ladder epoch. Assuming that the distribution of X_1 belongs to the domain of attraction of an…

Probability · Mathematics 2007-11-09 Vladimir Vatutin , Vitali Wachtel

For a one-dimensional simple random walk, let $g_1(n)$ denote the number of sites visited exactly once at time $n$. Major (1988) proved that \begin{equation*} \limsup_{n\to\infty}\frac{g_1(n)}{\log^2 n}=C\qquad a.s. \end{equation*} where…

Probability · Mathematics 2026-04-07 Chenxu Feng , Chenxu Hao

We prove that the law of a random walk $X_n$ is determined by the one-dimensional distributions of $\max(X_n, 0)$ for $n = 1, 2, \ldots$, as conjectured recently by Lo\"ic Chaumont and Ron Doney. Equivalently, the law of $X_n$ is determined…

Probability · Mathematics 2019-02-25 Mateusz Kwaśnicki

We consider a recurrent random walk on a rooted tree in random environment given by a branching random walk. Up to the first return to the root, its edge local times form a Multi-type Galton-Watson tree with countably infinitely many types.…

Probability · Mathematics 2020-10-02 Xinxin Chen , Loïc de Raphélis

Let $(S_n)_{n \geq 0}$ be a transient random walk in the domain of attraction of a stable law and let $(\xi(s))_{s \in \mathbb{Z}}$ be a stationary sequence of random variables. In a previous work, under conditions of type $D(u_n)$ and…

Probability · Mathematics 2022-10-11 Nicolas Chenavier , Ahmad Darwiche

Let $\{\xi(k), k \in \mathbb{Z} \}$ be a stationary sequence of random variables with conditions of type $D(u_n)$ and $D'(u_n)$. Let $\{S_n, n \in \mathbb{N} \}$ be a transient random walk in the domain of attraction of a stable law. We…

Probability · Mathematics 2019-10-11 Nicolas Chenavier , Ahmad Darwiche

We study the asymptotics for the maximum on a random time interval of a random walk with a long-tailed distribution of its increments and negative drift. We extend to a general stopping time a result by Asmussen (1998), simplify its proof,…

Probability · Mathematics 2017-11-29 Sergey Foss , Stan Zachary
‹ Prev 1 2 3 10 Next ›