相关论文: First Passage Properties of Molecular Spiders
We investigate continuous-time quantum walks of two fermionic atoms loaded in one-dimensional optical lattices with on-site interaction and subjected to a Zeeman field. The quantum walks are accompanied by spin-flipping processes. We…
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…
Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The important timescale in a variety of biophysical systems is the time…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
We consider a run-and-tumble particle on a finite interval $[a,b]$ with two absorbing end points. The particle has an internal velocity state that switches between three values $v,0,-v$ at exponential times, thus incorporating positive…
We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process…
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…
First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…
We consider the advection-diffusion transport of tracers in a one-parameter family of plane periodic flows where the patterns of streamlines feature regions of confined circulation in the shape of "cat's eyes", separated by meandering jets…
We consider the first-passage problem for $N$ identical independent particles that are initially released uniformly in a finite domain $\Omega$ and then diffuse toward a reactive area $\Gamma$, which can be part of the outer boundary of…
The problem of the detection statistics of a quantum walker has received increasing interest, connected as it is to the problem of quantum search. We investigate the effect of employing a moving detector, using a projective measurement…
New theorems for the moments of the first passage time of one dimensional nonlinear stochastic processes with an entrance boundary are formulated. This important class of one dimensional stochastic processes results among others from…
In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…
The time to first crossing for the Poisson counting process with respect to a linear moving barrier with offset is a classic problem, although key results remain scattered across the literature and their equivalence is often unclear. Here…
We study the efficiency of a two-channel reaction between two walkers on a finite one-dimensional periodic lattice. The walkers perform a combination of synchronous and asynchronous jumps on the lattice and react instantaneously when they…
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…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such a walk by studying the phase diagram…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…