Related papers: Extreme first passage times for random walks on ne…
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…
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 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…
In this paper, we study random walks on a small-world scale-free network, also called as pseudofractal scale-free web (PSFW), and analyze the volatilities of first passage time (FPT) and first return time (FRT) by using the variance and the…
We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks…
A collection of identical and independent rare event first passage times is considered. The problem of finding the fastest out of $N$ such events to occur is called an extreme first passage time. The rare event times are singular and limit…
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…
We extend the random walk framework to include compounded steps, providing first-passage time (FPT) properties for a new class of superdiffusive processes, which are governed by the space-fractional spectral Fokker-Planck equation. This…
We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a…
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…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search…
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…
A heterogeneous continuous time random walk is an analytical formalism for studying and modeling diffusion processes in heterogeneous structures on microscopic and macroscopic scales. In this paper we study both analytically and numerically…
Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…
We present general methods to exactly calculate mean-first passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and…
We present an analytical approximation scheme for the first passage time distribution on a finite interval of a random walker on a random forcing energy landscape. The approximation scheme captures the behavior of the distribution over all…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…
The first-passage time (FPT) is a fundamental concept in stochastic processes, representing the time it takes for a process to reach a specified threshold for the first time. Often, considering a time-dependent threshold is essential for…