Related papers: First passage properties in a crowded environment
In this study, inspired by the work of K. Nakazato and K. Kitahara [Prog. Theor. Phys. 64, 2261 (1980)], we consider the theoretical problem of tracer particle diffusion in an environment of diffusing hardcore interacting crowder particles.…
As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…
We present a model for diffusion in a molecularly crowded environment. The model consists of random barriers in percolation network. Random walks in the presence of slowly moving barriers show normal diffusion for long times, but anomalous…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
We use a first-passage time approach to study the statistics of the trapping times induced by persistent motion of active particles colliding with flat boundaries. The angular first-passage time distribution and mean first-passage time is…
A collection of identical and independent rare event first passage times is considered. The problem of finding the fastest out of $N$ such events to occur is called an extreme first passage time. The rare event times are singular and limit…
Virtually all the emergent properties of a complex system are rooted in the non-homogeneous nature of the behaviours of its elements and of the interactions among them. However, the fact that heterogeneity and correlations can appear…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
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…
We solve the problem of first-passage time for run-and-tumble particles in one dimension. Exact expression is derived for the mean first-passage time in the general case, considering external force-fields and chemotactic-fields, giving rise…
The first passage is a generic concept for quantifying when a random quantity such as the position of a diffusing molecule or the value of a stock crosses a preset threshold (target) for the first time. The last decade saw an enlightening…
A rapidly increasing number of systems is identified in which the stochastic motion of tracer particles follows the Brownian law $\langle\mathbf{r}^2(t) \rangle\simeq Dt$ yet the distribution of particle displacements is strongly…
Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…
First-passage times in random walks have a vast number of diverse applications in physics, chemistry, biology, and finance. In general, environmental conditions for a stochastic process are not constant on the time scale of the average…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…
We investigate how confinement may drastically change both the probability density of the first-encounter time and the related survival probability in the case of two diffusing particles. To obtain analytical insights into this problem, we…