相关论文: Average Trapping time on the 3-dimensional 3-level…
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 trapping problem on graph (or network) as a typical focus of great interest has attracted more attention from various science fields, including applied mathematics and theoretical computer science, in the past. Here, we first study this…
How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from…
The global first passage time density of a network is the probability that a random walker released at a random site arrives at an absorbing trap at time T. We find simple expressions for the mean global first passage time <T> for five…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
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…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
We investigate the dynamics of simultaneous random walkers with resetting on networks and derive exact analytical expressions for the mean first-encounter times of Markovian random walkers. Specifically, we consider two cases for the…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
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…
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…
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 study the mean first passage time of a one-dimensional active fluctuating membrane that is stochastically returned to the same flat initial condition at a finite rate. We start with a Fokker Planck equation to describe the evolution of…
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…
We determine the survival probability and first-passage time (FPT) to capture for a harmonically trapped particle, diffusing outside an absorbing spherical boundary by directly solving the differential equation for the survival probability.…
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 develop an analytical approach which provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on the source-target distance. Our approach puts forward two…