相关论文: Average Trapping time on the 3-dimensional 3-level…

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…

Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…

The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…

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 present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…

Many known networks have structure of affiliation networks, where each of $n$ network's nodes (actors) selects an attribute set from a given collection of $m$ attributes and two nodes (actors) establish adjacency relation whenever they…

The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…

Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…

We revise the classical problem of characterizing first exit times of a harmonically trapped particle whose motion is described by one- or multi-dimensional Ornstein-Uhlenbeck process. We start by recalling the main derivation steps of a…

A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) averaged over all starting points in…

We derive an approximate formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape inside an elongated domain of a slowly varying axisymmetric profile. For this purpose, the original Poisson equation in…

First passage phenomena arise across physics, biology, and finance when stochastic processes first reach a threshold, triggering downstream events. Examples include the irreversible exit from a domain, a biochemical reaction, a financial…

The statistics of first-passage times of random walks to target sites has proved to play a key role in determining the kinetics of space exploration in various contexts. In parallel, the number of distinct sites visited by a random walker…

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…

In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…

We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…

We present a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…

Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…

We study the synchronous dynamics of the Hopfield model when a random antisymmetric part is added to the otherwise symmetric synaptic matrix. We use a generating functional technique to derive analytical expressions for the order parameters…

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…