Uniform asymptotic approximation of diffusion to a small target

Target searches of interacting Brownian particles in dilute systems

We study the target searches of interacting Brownian particles in a finite domain, focusing on the effect of interparticle interactions on the search time. We derive the integral equation for the mean first-passage time and acquire its solution as a series expansion in the orders of the Mayer function. We analytically obtain the leading order correction to the search time for dilute systems, which are most relevant to target search problems and prove a universal relation given by the particle density and the second virial coefficient. Finally, we validate our theoretical prediction by Langevin dynamics simulations for the various types of the interaction potential.

Imperfect narrow escape problem

We consider the kinetics of the imperfect narrow escape problem, i.e., the time it takes for a particle diffusing in a confined medium of generic shape to reach and to be adsorbed by a small, imperfectly reactive patch embedded in the boundary of the domain, in two or three dimensions. Imperfect reactivity is modeled by an intrinsic surface reactivity κ of the patch, giving rise to Robin boundary conditions. We present a formalism to calculate the exact asymptotics of the mean reaction time in the limit of large volume of the confining domain. We obtain exact explicit results in the two limits of large and small reactivities of the reactive patch, and a semianalytical expression in the general case. Our approach reveals an anomalous scaling of the mean reaction time as the inverse square root of the reactivity in the large-reactivity limit, valid for an initial position near the extremity of the reactive patch. We compare our exact results with those obtained within the "constant flux approximation"; we show that this approximation turns out to give exactly the next-to-leading-order term of the small-reactivity limit, and provides a good approximation of the reaction time far from the reactive patch for all reactivities, but not in the vicinity of the boundary of the reactive patch due to the above-mentioned anomalous scaling. These results thus provide a general framework to quantify the mean reaction times for the imperfect narrow escape problem.

Enhancing search efficiency through diffusive echo

Despite having been studied for decades, first passage processes remain an active area of research. In this contribution we examine a particle diffusing in an annulus with an inner absorbing boundary and an outer reflective boundary. We obtain analytic expressions for the joint distribution of the hitting time and the hitting angle in two and three dimensions. For certain configurations we observe a ``diffusive echo", i.e. two well-defined maxima in the first passage time distribution to a targeted position on the absorbing boundary. This effect, which results from the interplay between the starting location and the environmental constraints, may help to significantly increase the efficiency of the random search by generating a high, sustained flux to the targeted position over a short period. Finally, we examine the corresponding one-dimensional system for which there is no well-defined echo. In a confined system, the flux integrated over all target positions always displays a shoulder. This does not, however, guarantee the presence of an echo in the joint distribution.

Optimal searcher distribution for parallel random target searches

We consider a problem of finding a target located in a finite d-dimensional domain, using N independent random walkers, when partial information about the target location is given as a probability distribution. When N is large, the first-passage time sensitively depends on the initial searcher distribution, which invokes the question of the optimal searcher distribution that minimizes the first-passage time. Here, we analytically derive the equation for the optimal distribution and explore its limiting expressions. If the target volume can be ignored, the optimal distribution is proportional to the target distribution to the power of one third. If we consider a target of a finite volume and the probability of the initial overlapping of searchers with the target cannot be ignored in the large N limit, the optimal distribution has a weak dependence on the target distribution, with its variation being proportional to the logarithm of the target distribution. Using Langevin dynamics simulations, we numerically demonstrate our predictions in one and two dimensions.

First-passage times to anisotropic partially reactive targets

We investigate restricted diffusion in a bounded domain towards a small partially reactive target in three- and higher-dimensional spaces. We propose a simple explicit approximation for the principal eigenvalue of the Laplace operator with mixed Robin-Neumann boundary conditions. This approximation involves the harmonic capacity and the surface area of the target, the volume of the confining domain, the diffusion coefficient, and the reactivity. The accuracy of the approximation is checked by using a finite-elements method. The proposed approximation determines also the mean first-reaction time, the long-time decay of the survival probability, and the overall reaction rate on that target. We identify the relevant lengthscale of the target, which determines its trapping capacity, and we investigate its relation to the target shape. In particular, we study the effect of target anisotropy on the principal eigenvalue by computing the harmonic capacity of prolate and oblate spheroids in various space dimensions. Some implications of these results in chemical physics and biophysics are briefly discussed.

Universal kinetics of imperfect reactions in confinement

Chemical reactions generically require that particles come into contact. In practice, reaction is often imperfect and can necessitate multiple random encounters between reactants. In confined geometries, despite notable recent advances, there is to date no general analytical treatment of such imperfect transport-limited reaction kinetics. Here, we determine the kinetics of imperfect reactions in confining domains for any diffusive or anomalously diffusive Markovian transport process, and for different models of imperfect reactivity. We show that the full distribution of reaction times is obtained in the large confining volume limit from the knowledge of the mean reaction time only, which we determine explicitly. This distribution for imperfect reactions is found to be identical to that of perfect reactions upon an appropriate rescaling of parameters, which highlights the robustness of our results. Strikingly, this holds true even in the regime of low reactivity where the mean reaction time is independent of the transport process, and can lead to large fluctuations of the reaction time - even in simple reaction schemes. We illustrate our results for normal diffusion in domains of generic shape, and for anomalous diffusion in complex environments, where our predictions are confirmed by numerical simulations.

Strong intracellular signal inactivation produces sharper and more robust signaling from cell membrane to nucleus

For a chemical signal to propagate across a cell, it must navigate a tortuous environment involving a variety of organelle barriers. In this work we study mathematical models for a basic chemical signal, the arrival times at the nuclear membrane of proteins that are activated at the cell membrane and diffuse throughout the cytosol. Organelle surfaces within human B cells are reconstructed from soft X-ray tomographic images, and modeled as reflecting barriers to the molecules’ diffusion. We show that signal inactivation sharpens signals, reducing variability in the arrival time at the nuclear membrane. Inactivation can also compensate for an observed slowdown in signal propagation induced by the presence of organelle barriers, leading to arrival times at the nuclear membrane that are comparable to models in which the cytosol is treated as an open, empty region. In the limit of strong signal inactivation this is achieved by filtering out molecules that traverse non-geodesic paths.

The inside of cells is a complex spatial environment, filled with organelles, filaments and proteins. It is an open question how cell signaling pathways function robustly in the presence of such spatial heterogeneity. In this work we study how organelle barriers influence the most basic of chemical signals; the diffusive propagation of an activated protein from the cell membrane to nucleus. Three-dimensional B cell organelle and membrane geometries reconstructed from soft X-ray tomographic images are used in building mathematical models of the signal propagation process. Our models demonstrate that organelle barriers significantly increase the time required for a diffusing protein to traverse from the cell membrane to nucleus when compared to a cell with an empty cytosolic space. We also show that signal inactivation, a fundamental component of all signaling pathways, can provide robustness in the signal arrival time in two ways. Increasing rates of signal inactivation reduce variability in the arrival time, while also dramatically reducing the degree to which organelle barriers increase the arrival time (in comparison to a cell with an empty cytosol).

Towards a full quantitative description of single-molecule reaction kinetics in biological cells

The first-passage time (FPT), i.e., the moment when a stochastic process reaches a given threshold value for the first time, is a fundamental mathematical concept with immediate applications. In particular, it quantifies the statistics of instances when biomolecules in a biological cell reach their specific binding sites and trigger cellular regulation. Typically, the first-passage properties are given in terms of mean first-passage times. However, modern experiments now monitor single-molecular binding-processes in living cells and thus provide access to the full statistics of the underlying first-passage events, in particular, inherent cell-to-cell fluctuations. We here present a robust explicit approach for obtaining the distribution of FPTs to a small partially reactive target in cylindrical-annulus domains, which represent typical bacterial and neuronal cell shapes. We investigate various asymptotic behaviours of this FPT distribution and show that it is typically very broad in many biological situations, thus, the mean FPT can differ from the most probable FPT by orders of magnitude. The most probable FPT is shown to strongly depend only on the starting position within the geometry and to be almost independent of the target size and reactivity. These findings demonstrate the dramatic relevance of knowing the full distribution of FPTs and thus open new perspectives for a more reliable description of many intracellular processes initiated by the arrival of one or few biomolecules to a small, spatially localised region inside the cell.

The escape problem for mortal walkers

We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a first-order kinetics (i.e., exponentially distributed lifetimes), we study the effect of the associated death rate onto the survival probability, the exit probability, and the mean first passage time. We derive the upper and lower bounds and some approximations for these quantities. We reveal three asymptotic regimes of small, intermediate, and large death rates. General estimates and asymptotics are compared to several explicit solutions for simple domains and to numerical simulations. These results allow one to account for stochastic photobleaching of fluorescent tracers in bio-imaging, degradation of mRNA molecules in genetic translation mechanisms, or high mortality rates of spermatozoa in the fertilization process. Our findings provide a mathematical ground for optimizing storage containers and materials to reduce the risk of leakage of dangerous chemicals or nuclear wastes.

Parallel random target searches in a confined space

We study a random target searching performed by N independent searchers in a d-dimensional domain of a large but finite volume. Considering the two initial distributions of searchers where searchers are either uniformly or point distributed, we estimate the mean time for the first of the searchers to reach the target and refer to it as searching time. The searching time for the uniformly distributed searchers exhibits a universal power-law dependence on N, irrespective of dimensionality and the target-to-domain size ratio. For point-distributed searching, the searching time has a logarithmic dependence on N in the large N limit, while in the small N limit, it shows qualitatively different behaviors depending upon r_{0}, the initial distance of the searchers from a target. We obtain a diagram by comparing the searching times of the two initial distributions in the parameter space (r_{0},N) and therein present the asymptotic lines separating three characteristic regions to explain numerical simulation results.

Uniform asymptotic approximation of diffusion to a small target: Generalized reaction models

The diffusion of a reactant to a binding target plays a key role in many biological processes. The reaction radius at which the reactant and target may interact is often a small parameter relative to the diameter of the domain in which the reactant diffuses. We develop uniform in time asymptotic expansions in the reaction radius of the full solution to the corresponding diffusion equations for two separate reactant-target interaction mechanisms: the Doi or volume reactivity model and the Smoluchowski-Collins-Kimball partial-absorption surface reactivity model. In the former, the reactant and target react with a fixed probability per unit time when within a specified separation. In the latter, upon reaching a fixed separation, they probabilistically react or the reactant reflects away from the target. Expansions of the solution to each model are constructed by projecting out the contribution of the first eigenvalue and eigenfunction to the solution of the diffusion equation and then developing matched asymptotic expansions in Laplace-transform space. Our approach offers an equivalent, but alternative, method to the pseudopotential approach we previously employed [Isaacson and Newby, Phys. Rev. E 88, 012820 (2013)PLEEE81539-375510.1103/PhysRevE.88.012820] for the simpler Smoluchowski pure-absorption reaction mechanism. We find that the resulting asymptotic expansions of the diffusion equation solutions are identical with the exception of one parameter: the diffusion-limited reaction rates of the Doi and partial-absorption models. This demonstrates that for biological systems in which the reaction radius is a small parameter, properly calibrated Doi and partial-absorption models may be functionally equivalent.

Hybrid asymptotic-numerical approach for estimating first-passage-time densities of the two-dimensional narrow capture problem

A hybrid asymptotic-numerical method is presented for obtaining an asymptotic estimate for the full probability distribution of capture times of a random walker by multiple small traps located inside a bounded two-dimensional domain with a reflecting boundary. As motivation for this study, we calculate the variance in the capture time of a random walker by a single interior trap and determine this quantity to be comparable in magnitude to the mean. This implies that the mean is not necessarily reflective of typical capture times and that the full density must be determined. To solve the underlying diffusion equation, the method of Laplace transforms is used to obtain an elliptic problem of modified Helmholtz type. In the limit of vanishing trap sizes, each trap is represented as a Dirac point source that permits the solution of the transform equation to be represented as a superposition of Helmholtz Green's functions. Using this solution, we construct asymptotic short-time solutions of the first-passage-time density, which captures peaks associated with rapid capture by the absorbing traps. When numerical evaluation of the Helmholtz Green's function is employed followed by numerical inversion of the Laplace transform, the method reproduces the density for larger times. We demonstrate the accuracy of our solution technique with a comparison to statistics obtained from a time-dependent solution of the diffusion equation and discrete particle simulations. In particular, we demonstrate that the method is capable of capturing the multimodal behavior in the capture time density that arises when the traps are strategically arranged. The hybrid method presented can be applied to scenarios involving both arbitrary domains and trap shapes.

Optimal search strategies of run-and-tumble walks

The run-and-tumble walk, consisting of randomly reoriented ballistic excursions, models phenomena ranging from gas kinetics to bacteria motility. We evaluate the mean time required for this walk to find a fixed target within a two- or three-dimensional spherical confinement. We find that the mean search time admits a minimum as a function of the mean run duration for various types of boundary conditions and run duration distributions (exponential, power-law, deterministic). Our result stands in sharp contrast to the pure ballistic motion, which is predicted to be the optimal search strategy in the case of Poisson-distributed targets.

First-Passage Time to Clear the Way for Receptor-Ligand Binding in a Crowded Environment

Certain biological reactions, such as receptor-ligand binding at cell-cell interfaces and macromolecules binding to biopolymers, require many smaller molecules crowding a reaction site to be cleared. Examples include the T-cell interface, a key player in immunological information processing. Diffusion sets a limit for such cavitation to occur spontaneously, thereby defining a time scale below which active mechanisms must take over. We consider N independent diffusing particles in a closed domain, containing a subregion with N_{0} particles, on average. We investigate the time until the subregion is empty, allowing a subsequent reaction to proceed. The first-passage time is computed using an efficient exact simulation algorithm and an asymptotic approximation in the limit that cavitation is rare. In this limit, we find that the mean first-passage time is subexponential, T∝e^{N_{0}}/N_{0}^{2}. For the case of T-cell receptors, we find that stochastic cavitation is exceedingly slow, 10^{9}  s at physiological densities; however, it can be accelerated to occur within 5 s with only a fourfold dilution.

Narrow escape problem with a mixed trap and the effect of orientation

We consider the mean first passage time (MFPT) of a two-dimensional diffusing particle to a small trap with a distribution of absorbing and reflecting sections. High-order asymptotic formulas for the MFPT and the fundamental eigenvalue of the Laplacian are derived which extend previously obtained results and show how the orientation of the trap affects the mean time to capture. We obtain a simple geometric condition which gives the optimal trap alignment in terms of the gradient of the regular part of a regular part of a Green's function and a certain alignment vector. We find that subdividing the absorbing portions of the trap reduces the mean first passage time of the diffusing particle. In the scenario where the trap undergoes prescribed motion in the domain, the MFPT is seen to be particularly sensitive to the orientation of the trap.