English
Related papers

Related papers: On the exit time from an orthant for badly oriente…

200 papers

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

Probability · Mathematics 2007-05-23 Doug Hensley , Francis Edward Su

We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…

Probability · Mathematics 2011-07-20 Itai Benjamini , Ori Gurel-Gurevich , Boris Solomyak

In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…

Probability · Mathematics 2017-06-13 Bastien Mallein

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$ and $\tilde Z_n(t)=\int…

Probability · Mathematics 2015-04-07 Xiaoqiang Wang , Chunmao Huang

We review some old and prove some new results on the survival probability of a random walk among a Poisson system of moving traps on Z^d, which can also be interpreted as the solution of a parabolic Anderson model with a random…

Probability · Mathematics 2012-05-04 Alexander Drewitz , Jürgen Gärtner , Alejandro F. Ramírez , Rongfeng Sun

We write $R_n$ for the minimal position attained after time $n$ by a branching random walk in the boundary case. In this article, we prove that $R_n - \frac{1}{2} \log n$ converges in law toward a shifted Gumbel distribution.

Probability · Mathematics 2016-07-20 Bastien Mallein

We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…

Probability · Mathematics 2007-05-23 Amine Asselah , Fabienne Castell

In continuum one-dimensional space, a coupled directed continuous time random walk model is proposed, where the random walker jumps toward one direction and the waiting time between jumps affects the subsequent jump. In the proposed model,…

Statistical Mechanics · Physics 2014-03-20 Long Shi , Zuguo Yu , Zhi Mao , Aiguo Xiao

We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…

Probability · Mathematics 2014-12-30 Ryoki Fukushima , Naoki Kubota

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

Probability · Mathematics 2012-12-12 Lung-Chi Chen , Rongfeng Sun

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

Combinatorics · Mathematics 2010-09-27 Omer Angel , Alexander E. Holroyd

We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching…

Probability · Mathematics 2026-05-26 Xinyi Li , Yushu Zheng

The time it takes a random walker in a lattice to reach the origin from another vertex $x$, has infinite mean. If the walker can restart the walk at $x$ at will, then the minimum expected hitting time $T(x,0)$ (minimized over restarting…

Probability · Mathematics 2010-05-25 Svante Janson , Yuval Peres

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

Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\over 2} \log n$ when $n\to \infty$.…

Probability · Mathematics 2011-02-02 Elie Aidekon , Zhan Shi

We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $\mathbb{P}[X \geq…

Probability · Mathematics 2022-04-12 Piotr Dyszewski , Nina Gantert , Thomas Höfelsauer

In this paper we generalize the result of directional transience from [SabotTournier10]. This enables us, by means of [Simenhaus07], [ZernerMerkl01] and [Bouchet12] to conclude that, on Z^d (for any dimension d), random walks in i.i.d.…

Probability · Mathematics 2012-11-19 Laurent Tournier

This work extends the studies on the minimum and extremal process of a supercritical branching random walk outside the boundary case which cannot be reduced to the boundary case. We study here the situation where the log-generating function…

Probability · Mathematics 2026-01-14 Xinxin Chen , Haojie Hou

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

We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…

Data Analysis, Statistics and Probability · Physics 2010-01-25 C. A. Serino , S. Redner