相关论文: Hitting and Trapping Times on Branched Structures

We derive an approximate but fully explicit formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape in a general elongated domain in the plane. Our approximation combines conformal mapping, boundary…

Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…

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 study the first hitting time statistics between a one-dimensional run-and-tumble particle and a target site that switches intermittently between visible and invisible phases. The two-state dynamics of the target is independent of the…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds ($F$) and…

As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…

We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…

We derive a general formula for computing the expected first return time of a random walk on a finite graph. Using this framework, we calculate the expected first return time in various settings over bounded rectangular grids with different…

An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…

Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as…

Let $G(N,p)=(V,E)$ be an Erd\"os-R\'enyi random graph and $(X_n)_{n \in \mathbb{N}}$ be a simple random walk on it. We study the the order of magnitude of $\sum_{i \in V} \pi_ih_{ij} $ where $\pi_i=d_i / 2|E|$ for $d_i$ the number of…

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…

The first passage is a generic concept for quantifying when a random quantity such as the position of a diffusing molecule or the value of a stock crosses a preset threshold (target) for the first time. The last decade saw an enlightening…

Combs are a simple caricature of various types of natural branched structures, which belong to the category of loopless graphs and consist of a backbone and branches. We study continuous time random walks on combs and present a generic…

We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…

In this paper, we show how to use stochastic approximation to compute hitting time of a stochastic process, based on the study of the time for a fluid approximation of this process to be at distance 1/N of its fixed point. This approach is…

The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…