English
Related papers

Related papers: Upper bounds for the maximum of a random walk with…

200 papers

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

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

Consider the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter $p$ and finite time horizon $n$. Allaart \cite{Allaart} proved that the optimal strategy…

Probability · Mathematics 2017-11-27 José A. Islas

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 study the maximum of a Brownian motion with a parabolic drift; this is a random variable that often occurs as a limit of the maximum of discrete processes whose expectations have a maximum at an interior point. We give series expansions…

Probability · Mathematics 2010-02-03 Svante Janson , Guy Louchard , Anders Martin-Löf

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

Let $\{\mm_n, n=0,1,...\}$ be the supercritical branching random walk starting with one initial ancestor located at the origin of the real line. For $n=0,1,...$ let $W_n$ be the moment generating function of $\mm_n$ normalized by its mean.…

Probability · Mathematics 2007-05-23 Aleksander Iksanov , Sergey Polotskiy

Let $\xi(n, x)$ be the local time at $x$ for a recurrent one-dimensional random walk in random environment after $n$ steps, and consider the maximum $\xi^*(n) = \max_x \xi(n,x)$. It is known that $\limsup \xi^*(n)/n$ is a positive constant…

Probability · Mathematics 2007-05-23 Amir Dembo , Nina Gantert , Yuval Peres , Zhan Shi

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

Probability · Mathematics 2022-05-12 Tuan-Minh Nguyen

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

Probability · Mathematics 2019-09-16 Antonio Di Crescenzo , Claudio Macci , Barbara Martinucci , Serena Spina

We develop explicit bounds for the tail of the distribution for the all-time supremum of a random walk with negative drift, where the increments have a truncated heavy-tailed distribution. As an application, we consider a ruin problem in…

Probability · Mathematics 2024-03-07 A. J. E. M. Janssen , B. Zwart

We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…

Information Theory · Computer Science 2015-04-29 Ameya Agaskar , Yue M. Lu

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 one-dimensional nearest neighbour random walk in site-random environment. We establish precise (sharp) large deviations in the so-called ballistic regime, when the random walk drifts to the right with linear speed. In the…

Probability · Mathematics 2018-01-08 Dariusz Buraczewski , Piotr Dyszewski

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

Probability · Mathematics 2009-11-03 Andrea Collevecchio , Tom Schmitz

In this paper we study extreme events for random walks on homogeneous spaces. We consider the following three cases. On the torus we study closest returns of a random walk to a fixed point in the space. For a random walk on the space of…

Dynamical Systems · Mathematics 2013-04-05 Maxim Sølund Kirsebom

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

Combinatorics · Mathematics 2007-05-23 P. J. Forrester

We consider a random walk $\tilde S$ which has different increment distributions in positive and negative half-planes. In the upper half-plane the increments are mean-zero i.i.d. with finite variance. In the lower half-plane we consider two…

Probability · Mathematics 2021-11-18 Andrey Pilipenko , Ben Povar

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

Probability · Mathematics 2024-07-23 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond