Related papers: Span observables - "When is a foraging rabbit no l…

We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…

In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…

We study the problem of estimating a compact set $S\subset \mathbb{R}^d$ from a trajectory of a reflected Brownian motion in $S$ with reflections on the boundary of $S$. We establish consistency and rates of convergence for various…

Statistical Inference is the process of determining a probability distribution over the space of parameters of a model given a data set. As more data becomes available this probability distribution becomes updated via the application of…

The statistics of the first-encounter time of diffusing particles changes drastically when they are placed under confinement. In the present work, we make use of Monte Carlo simulations to study the behavior of a two-particle system in two-…

We study persistence probabilities for random walks in correlated Gaussian random environment first studied by Oshanin, Rosso and Schehr. From the persistence results, we can deduce properties of critical branching processes with offspring…

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

We calculate analytically the probability density $P(t_m)$ of the time $t_m$ at which a continuous-time Brownian motion (with and without drift) attains its maximum before passing through the origin for the first time. We also compute the…

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…

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

Elephant random walk is a kind of one-dimensional discrete-time random walk with infinite memory: For each step, with probability $\alpha$ the walker adopts one of his/her previous steps uniformly chosen at random, and otherwise he/she…

We investigate the extreme value statistics of a one-dimensional Brownian motion (with the diffusion constant $D$) during a time interval $\left[0, t \right]$ in the presence of a reflective boundary at the origin, starting from a positive…

We consider a 1-dimensional Brownian motion whose diffusion coefficient varies when it crosses the origin. We study the long time behavior and we establish different regimes, depending on the variations of the diffusion coefficient:…

We study the persistent random walk of photons on a one-dimensional lattice of random transmittances. Transmittances at different sites are assumed independent, distributed according to a given probability density $f(t)$. Depending on the…

Let (Xt, t >= 0) be a diffusion process with jumps, sum of a Brownian motion with drift and a compound Poisson process. We consider T_x the first hitting time of a fixed level x > 0 by (Xt, t >= 0). We prove that the law of T_x has a…

A random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time \tau the random walk reaches a given level. Specifically, the p-moment…

Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

We study discounted random walks in directed graphs. In each step, the walk either terminates with a constant probability $\alpha$, or proceeds to a random out-neighbor. Our goal is to estimate the probability $\pi(s, t)$ that a discounted…

Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption…