Related papers: Mean trapping time for an arbitrary node on regula…
Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…
Recent studies have established a connection between the macroscopic mechanical response of polymeric materials and the statistics of the shortest path (SP) length between distant nodes in the polymer network. Since these statistics can be…
Continuous time random walk (CTRW) subdiffusion along with the associated fractional Fokker-Planck equation (FFPE) is traditionally based on the premise of random clock with divergent mean period. This work considers an alternative CTRW and…
We study the mean first passage time (MFPT) to an absorbing target of a one-dimensional Brownian particle subject to an external potential $v(x)$ in a finite domain. We focus on the cases in which the external potential is confining, of the…
Community detection is of fundamental significance for understanding the topology characters and the spreading dynamics on complex networks. While random walk is widely used and is proven effective in many community detection algorithms,…
Assessing the time scale of biological processes using molecular dynamics (MD) simulations with sufficient statistical accuracy is a challenging task, as processes are often rare and/or slow events, which may extend largely beyond the time…
We study the first passage time for a polymer, that we call the narrow encounter time (NETP), to reach a small target located on the surface of a microdomain. The polymer is modeled as a Freely Joint Chain (beads connected by springs with a…
We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…
We estimate the mean first time, called the mean rotation time (MRT), for a planar random polymer to wind around a point. This polymer is modeled as a collection of n rods, each of them being parameterized by a Brownian angle. We are led to…
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 consider a simple random walk on the T-fractal and we calculate the exact mean time $\tau^g$ to first reach the central node $i_0$. The mean is performed over the set of possible walks from a given origin and over the set of starting…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
The time it takes the fastest searcher out of $N\gg1$ searchers to find a target determines the timescale of many physical, chemical, and biological processes. This time is called an extreme first passage time (FPT) and is typically much…
The mean first-passage time (MFPT) for a Brownian particle to surmount a potential barrier of height $\Delta U$ is a fundamental quantity governing a wide array of physical and chemical processes. According to the Arrhenius Law, the MFPT…
Time-averaged trapping potentials have played an important role in the development of the field of ultracold atoms. Despite their widespread application, there is not yet a complete understanding of when a system can be considered…
We review recent advances in the theory of trapped fermions using techniques borrowed from random matrix theory (RMT) and, more generally, from the theory of determinantal point processes. In the presence of a trap, and in the limit of a…
In the present paper, we give the exact formula for the average hitting time (HT, as an abbreviation) of random walks from one vertex to any other vertex on the some weighted Cayley graphs.
We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…
We investigate the multifractals of the normalized first passage time on one-dimensional small-world network with both reflecting and absorbing barriers. The multifractals is estimated from the distribution of the normalized first passage…
A hybrid asymptotic-numerical method is presented for obtaining the full probability distribution of capture times of a random walker by multiple small traps located inside a bounded two-dimensional domain with reflective boundaries. As…