Related papers: First passage time for random walks in heterogeneo…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calculating MFPT on general graphs is not available because of…
Based on the analysis of probability flow, where the First Passage (FP) is realised as the sink of probability, we summarise the protocol to find the distribution of the First Passage Time (FTP). We also describe the corresponding formula…
This study investigates the first passage time (FPT) properties of particles with a broad class of positive stochastic diffusion coefficients (DCs), representing diffusion in heterogeneous environments or of particles with conformational…
The ``first passage-time'' (FPT) problem is an important problem with a wide range of applications in mathematics, physics, biology and finance. Mathematically, such a problem can be reduced to estimating the probability of a (stochastic)…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
General upper bounds on fluctuations of trajectory observables were recently obtained. It turned out that the size of fluctuations of dynamical observable is limited from below and from above. For the moment generating function of general…
We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
A one-dimensional run-and-tumble particle (RTP) switches randomly between a left and right moving state of constant speed $v$. This type of motion arises in a wide range of applications in cell biology, including the unbiased growth and…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
In this paper, we consider the problem of mean first-passage time (MFPT) in quantum mechanics; the MFPT is the average time of the transition from a given initial state, passing through some intermediate states, to a given final state for…
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 translocation of a single stranded DNA through a pore which fluctuates between two conformations, using coupled master equations. The probability density function of the first passage times (FPT) of the translocation…
A study of persistence dynamics is made for the first time in a quantum system by considering the dynamics of a quantum random walk. For a discrete walk on a line starting at $x=0$ at time $t=0$, the persistence probability $P(x,t)$ that a…