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

Let $m_{ij}$ be the mean first passage time from state $i$ to state $j$ in an $n$-state ergodic homogeneous Markov chain with transition matrix $T$. Let $G$ be the weighted digraph without loops whose vertex set coincides with the set of…

Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…

We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage…

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…

Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical…

Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its…

This paper analyzes the meeting time between a pair of pursuer and evader performing random walks on digraphs. The existing bounds on the meeting time usually work only for certain classes of walks and cannot be used to formulate…

Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge…

Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…

Recent works have explored the properties of L\'evy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the Mean First Passage Time (MFPT)…

We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…

We study the statistics of the first passage of a random walker to absorbing subsets of the boundary of compact domains in different spatial dimensions. We describe a novel diagnostic method to quantify the trajectory-to-trajectory…

We study the simple random walk dynamics on an annealed version of a Small-World Network (SWN) consisting of $N$ nodes. This is done by calculating the mean number of distinct sites visited S(n) and the return probability $P_{00}(t)$ as a…

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…

All real physical processes, including of the first-passage time, occur with a change in entropy. This circumstance is not taken into account when studying the first-passage time, but is illustrated in this article using the example of…

The first passage time (FPT) is a generic measure that quantifies when a random quantity reaches a specific state. We consider the FTP distribution in nonlinear stochastic biochemical networks, where obtaining exact solutions of the…

A method is established which allows the calculation of the walk dimension for Sierpinski-type multifractals. The multifractal scaling behaviour of the average time needed to cover a distance in the mentionned multifractals is shown. For…

We investigate the average hitting times of simple random walks on the $k$-th power graph $C_N^k$ of the cycle graph $C_N$. First, we show that the average hitting times are characterized by a difference equation corresponding to the graph…

First passage time (FPT) theory is often used to estimate timescales in cellular and molecular biology. While the overwhelming majority of studies have focused on the time it takes a given single Brownian searcher to reach a target,…

This work addresses synchronization in transient, non-linear stochastic dynamics corresponding to accesses performed by self-avoiding walks originating at each node of a complex network. More specifically, the synchronizability of accesses…