Refine
Language
- English (13) (remove)
Is part of the Bibliography
- yes (13) (remove)
Keywords
- diffusion (13) (remove)
Institute
- Institut für Physik und Astronomie (13) (remove)
We consider the first-passage problem for N identical independent particles that are initially released uniformly in a finite domain Ω and then diffuse toward a reactive area Γ, which can be part of the outer boundary of Ω or a reaction centre in the interior of Ω. For both cases of perfect and partial reactions, we obtain the explicit formulas for the first two moments of the fastest first-passage time (fFPT), i.e., the time when the first out of the N particles reacts with Γ. Moreover, we investigate the full probability density of the fFPT. We discuss a significant role of the initial condition in the scaling of the average fFPT with the particle number N, namely, a much stronger dependence (1/N and 1/N² for partially and perfectly reactive targets, respectively), in contrast to the well known inverse-logarithmic behaviour found when all particles are released from the same fixed point. We combine analytic solutions with scaling arguments and stochastic simulations to rationalise our results, which open new perspectives for studying the relevance of multiple searchers in various situations of molecular reactions, in particular, in living cells.
We consider the first-passage problem for N identical independent particles that are initially released uniformly in a finite domain Ω and then diffuse toward a reactive area Γ, which can be part of the outer boundary of Ω or a reaction centre in the interior of Ω. For both cases of perfect and partial reactions, we obtain the explicit formulas for the first two moments of the fastest first-passage time (fFPT), i.e., the time when the first out of the N particles reacts with Γ. Moreover, we investigate the full probability density of the fFPT. We discuss a significant role of the initial condition in the scaling of the average fFPT with the particle number N, namely, a much stronger dependence (1/N and 1/N² for partially and perfectly reactive targets, respectively), in contrast to the well known inverse-logarithmic behaviour found when all particles are released from the same fixed point. We combine analytic solutions with scaling arguments and stochastic simulations to rationalise our results, which open new perspectives for studying the relevance of multiple searchers in various situations of molecular reactions, in particular, in living cells.
We consider a sequential cascade of molecular first-reaction events towards a terminal reaction centre in which each reaction step is controlled by diffusive motion of the particles. The model studied here represents a typical reaction setting encountered in diverse molecular biology systems, in which, e.g. a signal transduction proceeds via a series of consecutive 'messengers': the first messenger has to find its respective immobile target site triggering a launch of the second messenger, the second messenger seeks its own target site and provokes a launch of the third messenger and so on, resembling a relay race in human competitions. For such a molecular relay race taking place in infinite one-, two- and three-dimensional systems, we find exact expressions for the probability density function of the time instant of the terminal reaction event, conditioned on preceding successful reaction events on an ordered array of target sites. The obtained expressions pertain to the most general conditions: number of intermediate stages and the corresponding diffusion coefficients, the sizes of the target sites, the distances between them, as well as their reactivities are arbitrary.