Related papers: Tracking a Random Walk First-Passage Time Through …

We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-\delta -1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that…

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…

The times of Brownian local minima, maxima and their union are three distinct examples of local, stationary, dense, random countable sets associated with classical Wiener noise. Being local means, roughly, determined by the local behavior…

Motivated by the dynamics of resonant neurons we consider a differentiable, non-Markovian random process $x(t)$ and particularly the time after which it will reach a certain level $x_b$. The probability density of this first passage time is…

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was…

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

Random walks, and in particular, their first passage times, are ubiquitous in nature. Using direct enumeration of paths, we find the first return time distribution of a 1D random walker, which is a heavy-tailed distribution with infinite…

First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…

The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…

Consider a stable L\'evy process $X=(X_t,t\geq 0)$ and let $T_x$, for $x>0$, denote the first passage time of $X$ above the level $x$. In this work, we give an alternative proof of the absolute continuity of the law of $T_x$ and we obtain a…

We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…

We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

The paper considers excited random walks (ERWs) on integers in i.i.d. environments with a bounded number of excitations per site. The emphasis is primarily on the critical case for the transition between recurrence and transience which…

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…

We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…