Related papers: Mean trapping time for an arbitrary node on regula…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the associated stochastic master equation, with the eigenvalues…
In this paper, we consider the random walk process on a kind of fractal (or transfractal) scale free networks, which also called as $(u,v)$ flowers, and we focus on the global first passage time (GFPT) and first return time (FRT). Here, we…
In this paper we address the problem of the calculation of the mean first passage time (MFPT) on generic graphs. We focus in particular on the mean first passage time on a node 's' for a random walker starting from a generic, unknown, node…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
How much time does it take for a fluctuating system, such as a polymer chain, to reach a target configuration that is rarely visited -- typically because of a high energy cost ? This question generally amounts to the determination of the…
In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of…
The first return time (FRT) is the time it takes a random walker to first return to its original site, and the global first passage time (GFPT) is the first passage time for a random walker to move from a randomly selected site to a given…
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk…
We study the problem of searching for a fixed path $\epsilon_0\epsilon_1\cdots\epsilon_l$ on a network through random walks. We analyze the first hitting time of tracking the path, and obtain exact expression of mean first hitting time…
Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such…
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…
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…
The determination of the mean first passage time (MFPT) for a Brownian particle in a bounded 2-D domain containing small absorbing traps is a fundamental problem with biophysical applications. The average MFPT is the expected capture time…
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…
A variation of Rosenstock's trapping model in which $N$ independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a {\em one-sided} random distribution (with probability $c$) of…
We study the statistics of the first-passage time of a single run and tumble particle (RTP) in one spatial dimension, with or without resetting, to a fixed target located at $L>0$. First, we compute the first-passage time distribution of a…
Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…
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…
We study a one-dimensional run-and-tumble particle (RTP), which is a prototypical model for active system, moving within an arbitrary external potential. Using backward Fokker-Planck equations, we derive the differential equation satisfied…