Related papers: First passage time for random walks in heterogeneo…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
The first passage time for a single diffusing particle has been studied extensively, but the first passage time of a system of many diffusing particles, as is often the case in physical systems, has received little attention until recently.…
Fluctuations in stochastic systems are usually characterized by the full counting statistics, which analyzes the distribution of the number of events taking place in the fixed time interval. In an alternative approach, the distribution of…
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 propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors depending on their degrees. For this ergodic dynamics, we…
The mean first passage time, one of the important characteristics for a stochastic process, is often calculated assuming the observation time is infinite. However, in practice, the observation time, T, is always finite and the mean first…
We study the first-passage properties of a jump process with constant drift where jump amplitudes and inter-arrival times follow arbitrary light-tailed distributions with smooth densities. Using a mapping to an effective discrete-time…
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
We derive the asymptotic first passage time (FPT) distribution for space-dependent variable-order time-fractional diffusion, where the fractional exponent $\alpha(x)$ varies with position. For any sufficiently smooth $\alpha(x)$ on a finite…
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…
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 first-passage time (FPT) problem for widespread recurrent processes in confined though large systems and present a comprehensive framework for characterizing the FPT distribution over many time scales. We find that the FPT…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Often sharp changes in cellular behavior are triggered by thresholded events, i.e., by the attainment of a threshold value of a relevant cellular or molecular dynamical variable. Since the governing variable itself typically undergoes noisy…
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 study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration $t_w$ and random long-range jumps. While the time the walker needs to cover all the…
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…