Related papers: First passage time distribution for a random walke…
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (target) by hopping…
The continuous time random walk model has been widely applied in various fields, including physics, biology, chemistry, finance, social phenomena, etc. In this work, we present an algorithm that utilizes a subordinate formula to generate…
We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…
Finding a target in a complex environment is a fundamental challenge in nature, from chemical reactions to sperm reaching an egg. An effective strategy to reduce the time needed to reach a target is to deploy many searchers, increasing the…
The motion of a lazy Pearson walker is studied with different probability ($p$) of jump in two and three dimensions. The probability of exit ($P_e$) from a zone of radius $r_e$, is studied as a function of $r_e$ with different values of…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…
This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…
Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
Even after decades of research the problem of first passage time statistics for quantum dynamics remains a challenging topic of fundamental and practical importance. Using a projective measurement approach, with a sampling time $\tau$, we…
The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…
We propose an analytical approach to study non-Markov random walks by employing an exact enumeration method. Using the method, we derive an exact expansion for the first-passage time (FPT) distribution for any continuous, differentiable…
This paper is an overview of the classical level crossing problem which is studied extensively in the literature and is fundamental in many branches of applied probability. We discuss a number of approximations with an emphasis on their…
We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a…
As known, the commonly-utilized ways to determine mean first-passage time $\overline{\mathcal{F}}$ for random walk on networks are mainly based on Laplacian spectra. However, methods of this type can become prohibitively complicated and…
We consider the general problem of the first passage distribution of particles whose displacements are subject to time delays. We show that this problem gives rise to a \emph{propagation-dispersion equation} which is obtained as the…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…