Related papers: Ring structures and mean first passage time in net…
Markov processes are widely used models for investigating kinetic networks. Here we collate and present a variety of results pertaining to kinetic network models, in a unified framework. The aim is to lay out explicit links between several…
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…
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 consider a run-and-tumble particle (RTP) in one dimension, subjected to a telegraphic noise with a constant rate $\gamma$, and in the presence of an external confining potential $V(x) = \alpha |x|^p$ with $p \geq 1$. We compute the mean…
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
The regular hyperbranched polymers (RHPs), also known as Vicsek fractals, are an important family of hyperbranched structures which have attracted a wide spread attention during the past several years. In this paper, we study the…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
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…
A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
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…
We derive a functional equation for the mean first-passage time (MFPT) of a generic self-similar Markovian continuous process to a target in a one-dimensional domain and obtain its exact solution. We show that the obtained expression of the…
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 present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of $N$ nodes of degree $c \ge 3$. Starting from a random initial node $i$ at time $t=0$, at each…
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 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…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
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 propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
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…