Related papers: Estimating a Random Walk First-Passage Time from N…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

We study random walks on metric spaces with contracting isometries. In this first article of the series, we establish sharp deviation inequalities by adapting Gou\"ezel's pivotal time construction. As an application, we establish the…

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

We consider the first-crossing-time problem through a constant boundary for a Wiener process perturbed by random jumps driven by a counting process. On the base of a sample-path analysis of the jump-diffusion process we obtain explicit…

We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…

We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…

We investigate a quantum walk on a ring represented by a directed triangle graph with complex edge weights and monitored at a constant rate until the quantum walker is detected. To this end, the first hitting time statistics is recorded…

We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.

In a classical optimal stopping problem in continuous time, the agent can choose any stopping time without constraint. Dupuis and Wang (Optimal stopping with random intervention times, Advances in Applied Probability, 34, 141--157, 2002)…

We introduce a family of stochastic processes on the integers, depending on a parameter $p \in [0,1]$ and interpolating between the deterministic rotor walk (p=0) and the simple random walk (p=1/2). This p-rotor walk is not a Markov chain…

Let $S_n$ be a random walk with i.i.d. increments which have zero mean and finite variance. For every $x\ge0$ we define the stopping time $\tau_x:=\inf\{n\ge1:x+S_n\le0\}$ and consider the probabilities $\mathbb{P}(x+S_n\ge y,\tau_x>n)$. We…

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

We investigate the distribution of the time spent by a random walker to the right of a boundary moving with constant velocity v. For the continuous-time problem (Brownian motion), we provide a simple alternative proof of Newman's recent…

We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…