Related papers: First passage time exponent for higher-order rando…
L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…
L\'{e}vy walk is a practical model and has wide applications in various fields. Here we focus on the effect of an external constant force on the L\'{e}vy walk with the exponent of the power-law distributed flight time $\alpha\in(0,2)$. We…
We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…
Many transport processes in ecology, physics and biochemistry can be described by the average time to first find a site or exit a region, starting from an initial position. Typical mathematical treatments are based on formulations that…
In this paper, we reveal the branching structure for a non-homogeneous random walk with bounded jumps. The ladder time $T_1,$ the first hitting time of $[1,\infty)$ by the walk starting from $0,$ could be expressed in terms of a…
We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…
We compute in a relativistic way the time-of-arrival and the traversal time through a region of a free particle with spin 1/2. We do this by applying the relativistic extension of the Event-Enhanced Quantum Theory which we have presented in…
Let X_t be a subordinate Brownian motion, and suppose that the Levy measure of the underlying subordinator has completely monotone density. Under very mild conditions, we find integral formulae for the tail distribution P(\tau_x > t) of…
We revisit the simple lattice random walk (P\'{o}lya walk) and the Sisyphus random walk in $\mathbb{Z}$, in the presence of random restarts. We use a relatively direct approach namely First passage under restart for discrete space and time…
We investigate first-passage statistics of an ensemble of N noninteracting random walks on a line. Starting from a configuration in which all particles are located in the positive half-line, we study S_n(t), the probability that the nth…
A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…
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…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
The first-passage time (FPT), defined as the time a random walker takes to reach a target point in a confining domain, is a key quantity in the theory of stochastic processes. Its importance comes from its crucial role to quantify the…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…
Exact results for the first passage time and leapover statistics of symmetric and one-sided Levy flights (LFs) are derived. LFs with stable index alpha are shown to have leapover lengths, that are asymptotically power-law distributed with…