Geometry-controlled kinetics

Boosting macroscopic diffusion with local resetting

Stochastic interactions generically enhance self-diffusivity in living and biological systems, e.g., optimizing navigation strategies and controlling material properties of cellular tissues and bacterial aggregates. Despite this, the physical mechanisms underlying this nonequilibrium behavior are poorly understood. Here, we introduce a model of interactions between an agent and its environment in the form of a local stochastic resetting mechanism, in which the agent's position is set to the nearest of a predetermined array of sites with a fixed rate. We derive analytic results for the self-diffusion coefficient, showing explicitly that this mechanism enhances diffusivity. Strikingly, we show analytically that this enhancement is optimized by regular arrays of resetting sites. Altogether, our results ultimately provide the conditions for the optimization of the macroscopic transport properties of diffusive systems with local random binding interactions.

Precisely controlled colloids: a playground for path-wise non-equilibrium physics

We investigate path-wise observables in experiments on driven colloids in a periodic light field to dissect selected intricate transport features, kinetics, and transition-path time statistics out of thermodynamic equilibrium. These observables directly reflect the properties of individual paths in contrast to the properties of an ensemble of particles, such as radial distribution functions or mean-squared displacements. In particular, we present two distinct albeit equivalent formulations of the underlying stochastic equation of motion, highlight their respective practical relevance, and show how to interchange between them. We discuss conceptually different notions of local velocities and interrogate one- and two-sided first-passage and transition-path time statistics in and out of equilibrium. Our results reiterate how path-wise observables may be employed to systematically assess the quality of experimental data and demonstrate that, given sufficient control and sampling, one may quantitatively verify subtle theoretical predictions.

Drift-diffusive resetting search process with stochastic returns: Speedup beyond optimal instantaneous return

Stochastic resetting has recently emerged as a proficient strategy to reduce the completion time for a broad class of first-passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start afresh and continue evolving in time until the target goal is met. This is, however, an instantaneous process and thus less feasible for any practical purposes. A crucial generalization in this regard is to consider a finite-time return process which has significant ramifications to the firstpassage properties. Intriguingly, it has recently been shown that for diffusive search processes, returning in finite but stochastic time can gain significant speedup over the instantaneous resetting process. Unlike diffusion which has a diverging mean completion time, in this paper, we ask whether this phenomena can also be observed for a first-passage process with finite mean completion time. To this end, we explore the setup of a classical drift-diffusive search process in one dimension with stochastic resetting and further assume that the return phase is modulated by a potential U(x)=λ|x| with λ>0. For this process, we compute the mean first-passage time exactly and underpin its characteristics with respect to the resetting rate and potential strength. We find a unified phase space that allows us to explore and identify the system parameter regions where stochastic return supersedes over both the underlying process and the process under instantaneous resetting. Furthermore and quite interestingly, we find that for a range of parameters the mean completion time under stochastic return protocol can be reduced further than the optimally restarted instantaneous processes. We thus believe that resetting with stochastic returns can serve as a better optimization strategy owing to its dominance over classical first passage under resetting.

First-passage times to a fractal boundary: Local persistence exponent and its log-periodic oscillations

We investigate the statistics of the first-passage time (FPT) to a fractal self-similar boundary of the Koch snowflake. When the starting position is fixed near the absorbing boundary, the FPT distribution exhibits an apparent power-law decay over a broad range of timescales, culminated by an exponential cutoff. By extensive Monte Carlo simulations, we compute the local persistence exponent of the survival probability and reveal its log-periodic oscillations in time due to self-similarity of the boundary. The effect of the starting point on this behavior is analyzed in depth. Theoretical bounds on the survival probability are derived from the analysis of diffusion in a circular sector. Physical rationales for the refined structure of the survival probability are presented.

Search with stochastic home returns can expedite classical first passage under resetting

Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in calibrating these zero time irreversible transitions. Here, we consider a strategy in which resetting is performed using finite-time return protocols in lieu of instantaneous returns. These controls could also be accompanied with random fluctuations or errors allowing target detection even during the return phase. To better understand the phenomena, we develop a unified renewal approach that can encapsulate arbitrary search processes centered around home in a fairly general topography containing targets, various resetting times, and return mechanisms in arbitrary dimensions. While such finite-time protocols would apparently seem to prolong the overall search time in comparison to the instantaneous resetting process, we show on the contrary that a significant speed-up can be gained by leveraging the stochasticity in home returns. The formalism is then explored to reveal a universal criterion distilling the benefits of this strategy. We demonstrate how this general principle can be utilized to improve overall performance of a one-dimensional diffusive search process reinforced with experimentally feasible parameters. We believe that such strategies designed with inherent randomness can be made optimal with precise controllability in complex search processes.

Unified approach to reset processes and application to coupling between process and reset

Processes under reset, where realizations are interrupted according to some stochastic rule and restarted from the initial state, find broad application in modeling physical, chemical, and biological phenomena and in designing search strategies. While a wealth of theoretical results has been recently obtained, current derivations tend to focus on specific processes, obscuring the general principles and preventing broad applicability. We present a unified approach to those observables of stochastic processes under reset that take the form of averages of functionals depending on the most recent renewal period. We derive general solutions, and determine the conditions for existence and equality of stationary values with and without reset. For intermittent (i.e., broadly distributed) reset times, we derive exact asymptotic expressions for observables that vary asymptotically as a power of time. We illustrate the general approach with results for occupation densities and moments of subdiffusive processes. We focus on subdiffusion-decay processes with microscopic dependence between transport and decay, where the probability of a random walker to be removed and subsequently restarted depends on the local transit times. In contrast to the uncoupled case, restarting the particle upon decay does not produce a probability current associated with restart equal to the decay rate, but instead drastically alters the time dependence of the decay rate and the resulting current due to memory effects associated with ageing. Our framework shows that such effects are independent of the specific microscopic details, uncovering the general impact of restart on occupation densities, spatial moments, and other quantities.

Braess's Paradox Analog in Physical Networks of Optimal Exploration

In stochastic exploration of geometrically embedded graphs, intuition suggests that providing a shortcut between a pair of nodes reduces the mean first passage time of the entire graph. Counterintuitively, we find a Braess's paradox analog. For regular diffusion, shortcuts can worsen the overall search efficiency of the network, although they bridge topologically distant nodes. We propose an optimization scheme under which each edge adapts its conductivity to minimize the graph's search time. The optimization reveals a relationship between the structure and diffusion exponent and a crossover from dense to sparse graphs as the exponent increases.

Real-time observation of sub-100-fs charge and energy transfer processes in DNA dinucleotides

Using as showcase the DNA dinucleotide 5'-dTpdG-3', in which the thymine (T) is located at the 5' end with respect to the guanine (G), we study the photoinduced electronic relaxation of coupled chromophores in solution with an unprecedented refinement. On the one hand, transient absorption spectra are recorded from 20 fs to 45 ps over the 330-650 nm range with a temporal resolution of 30 fs; on the other hand, quantum chemistry calculations determine the ground state geometry of the 4 possible conformers with stacked nucleobases, the associated Franck-Condon states, and map the relaxation pathways leading to excited state minima. Important spectral changes occurring before 100 fs are correlated with concomitant G+ → T- charge transfer and T → G energy transfer processes. The lifetime of the excited charge transfer state is only 5 ps and the absorption spectrum of a long-lived nπ*T state is detected. Our experimental results match the transient spectral properties computed for the anti-syn conformer of 5'-dTpdG-3', which is characterized by the lowest ground state energy and differs from that encountered in B-form duplexes.

Diffusive lensing as a mechanism of intracellular transport and compartmentalization

While inhomogeneous diffusivity has been identified as a ubiquitous feature of the cellular interior, its implications for particle mobility and concentration at different length scales remain largely unexplored. In this work, we use agent-based simulations of diffusion to investigate how heterogeneous diffusivity affects the movement and concentration of diffusing particles. We propose that a nonequilibrium mode of membrane-less compartmentalization arising from the convergence of diffusive trajectories into low-diffusive sinks, which we call 'diffusive lensing,' is relevant for living systems. Our work highlights the phenomenon of diffusive lensing as a potentially key driver of mesoscale dynamics in the cytoplasm, with possible far-reaching implications for biochemical processes.

Optimizing Work Extraction in the Presence of an Entropic Potential: An Entropic Stochastic Resonance

We study the nontrivial thermodynamic responses of an overdamped Brownian system driven by an unbiased driving force when the particle is confined inside a bilobal irregular structure. The spatial irregularity of the confinement results in an effective entropic bistable potential along the direction of transport. We calculate the thermodynamic response functions in terms of the averaged work done and the absorbed heat over a cycle of driving. We find that the thermodynamic responses are influenced by the nonlinearity of the effective entropic potential, the frequency of the external periodic driving force, and the random thermal fluctuations in a nontrivial way. In the presence of an optimal amount of thermal noise and a favoring driving frequency, the process exhibits a resonance-like precedent in terms of both output work and absorbed heat. We explore the conditions to get best synchronized work extraction (or absorbed heat), which can be utilized as a potential quantifier of an entropic stochastic resonance phenomenon. Finally, we identify a hallmark of entropy dominance over an analogous energy-driven scenario in terms of output work.

Active search for a reactive target in thermal environments

We study a stochastic process where an active particle, modeled by a one-dimensional run-and-tumble particle, searches for a target with a finite absorption strength in thermal environments. Solving the Fokker-Planck equation for a uniform initial distribution, we analytically calculate the mean searching time (MST), the time for the active particle to be finally absorbed, and show that there exists an optimal self-propulsion velocity of the active particle at which MST is minimized. As the diffusion constant increases, the optimal velocity changes from a finite value to zero, which implies that a purely diffusive Brownian motion outperforms an active motion in terms of searching time. Depending on the absorption strength of the target, the transition of the optimal velocity becomes either continuous or discontinuous, which can be understood based on the Landau approach. In addition, we obtain the phase diagram indicating the passive-efficient and the active-efficient regions. Finally, the initial condition dependence of MST is presented in limiting cases.

Searching for a partially absorbing target by a run-and-tumble particle in a confined space

A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a nonmonotonic behavior as a function of the self-propulsion speed of the active particle, indicating the existence of an optimal speed, when the absorption strength of the target is finite. In the limit of large and small absorption strengths, respectively, asymptotes of the mean searching time and the optimal speed are found. We also demonstrate that the first-passage problem of a diffusive run-and-tumble particle in high dimensions can be mapped into a one-dimensional problem with a partially absorbing target. Finally, as a practical application exploiting the existence of the optimal speed, we propose a filtering device to extract active particles with a desired speed and evaluate how the resolution of the filtering device depends on the absorption strength.

Controlling Uncertainty of Empirical First-Passage Times in the Small-Sample Regime

We derive general bounds on the probability that the empirical first-passage time τ[over ¯]_{n}≡∑_{i=1}^{n}τ_{i}/n of a reversible ergodic Markov process inferred from a sample of n independent realizations deviates from the true mean first-passage time by more than any given amount in either direction. We construct nonasymptotic confidence intervals that hold in the elusive small-sample regime and thus fill the gap between asymptotic methods and the Bayesian approach that is known to be sensitive to prior belief and tends to underestimate uncertainty in the small-sample setting. We prove sharp bounds on extreme first-passage times that control uncertainty even in cases where the mean alone does not sufficiently characterize the statistics. Our concentration-of-measure-based results allow for model-free error control and reliable error estimation in kinetic inference, and are thus important for the analysis of experimental and simulation data in the presence of limited sampling.

Heterogeneous Mean First-Passage Time Scaling in Fractal Media

The mean first passage time (MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the distance between a source and a target site with a universal exponent. We find that the scaling law for the MFPT is not determined solely by the distance between a source and a target but also by their locations. The role of a site in the first passage processes is quantified by the random walk centrality. It turns out that the site of highest random walk centrality, dubbed as a hub, intervenes in first passage processes. We show that the MFPT from a departure site to a target site is determined by a competition between direct paths and indirect paths detouring via the hub. Consequently, the MFPT displays a crossover scaling between a short distance regime, where direct paths are dominant, and a long distance regime, where indirect paths are dominant. The two regimes are characterized by power laws with different scaling exponents. The crossover scaling behavior is confirmed by extensive numerical calculations of the MFPTs on the critical percolation cluster in two dimensional square lattices.

Diffusion-Controlled Reactions: An Overview

We review the milestones in the century-long development of the theory of diffusion-controlled reactions. Starting from the seminal work by von Smoluchowski, who recognized the importance of diffusion in chemical reactions, we discuss perfect and imperfect surface reactions, their microscopic origins, and the underlying mathematical framework. Single-molecule reaction schemes, anomalous bulk diffusions, reversible binding/unbinding kinetics, and many other extensions are presented. An alternative encounter-based approach to diffusion-controlled reactions is introduced, with emphasis on its advantages and potential applications. Some open problems and future perspectives are outlined.

Collective catalysis under spatial constraints: Phase separation and size-scaling effects on mass action kinetics

Chemical reactions are usually studied under the assumption that both substrates and catalysts are well-mixed (WM) throughout the system. Although this is often applicable to test-tube experimental conditions, it is not realistic in cellular environments, where biomolecules can undergo liquid-liquid phase separation (LLPS) and form condensates, leading to important functional outcomes, including the modulation of catalytic action. Similar processes may also play a role in protocellular systems, like primitive coacervates, or in membrane-assisted prebiotic pathways. Here we explore whether the demixing of catalysts could lead to the formation of microenvironments that influence the kinetics of a linear (multistep) reaction pathway, as compared to a WM system. We implemented a general lattice model to simulate LLPS of a collection of different catalysts and extended it to include diffusion and a sequence of reactions of small substrates. We carried out a quantitative analysis of how the phase separation of the catalysts affects reaction times depending on the affinity between substrates and catalysts, the length of the reaction pathway, the system size, and the degree of homogeneity of the condensate. A key aspect underlying the differences reported between the two scenarios is that the scale invariance observed in the WM system is broken by condensation processes. The main theoretical implications of our results for mean-field chemistry are drawn, extending the mass action kinetics scheme to include substrate initial "hitting times" to reach the catalysts condensate. We finally test this approach by considering open nonlinear conditions, where we successfully predict, through microscopic simulations, that phase separation inhibits chemical oscillatory behavior, providing a possible explanation for the marginal role that this complex dynamic behavior plays in real metabolisms.

Tube geometry controls protein cluster conformation and stability on the endoplasmic reticulum surface

The endoplasmic reticulum (ER), a cellular organelle that forms a cell-spanning network of tubes and sheets, is an important location of protein synthesis and folding. When the ER experiences sustained unfolded protein stress, IRE1 proteins embedded in the ER membrane activate and assemble into clusters as part of the unfolded protein response (UPR). We use kinetic Monte Carlo simulations to explore IRE1 clustering dynamics on the surface of ER tubes. While initially growing clusters are approximately round, once a cluster is sufficiently large a shorter interface length can be achieved by 'wrapping' around the ER tube. A wrapped cluster can grow without further interface length increases. Relative to wide tubes, narrower tubes enable cluster wrapping at smaller cluster sizes. Our simulations show that wrapped clusters on narrower tubes grow more rapidly, evaporate more slowly, and require a lower protein concentration to grow compared to equal-area round clusters on wider tubes. These results suggest that cluster wrapping, facilitated by narrower tubes, could be an important factor in the growth and stability of IRE1 clusters and thus impact the persistence of the UPR, connecting geometry to signaling behavior. This work is consistent with recent experimental observations of IRE1 clusters wrapped around narrow tubes in the ER network.

Endoplasmic reticulum network heterogeneity guides diffusive transport and kinetics

The endoplasmic reticulum (ER) is a dynamic network of interconnected sheets and tubules that orchestrates the distribution of lipids, ions, and proteins throughout the cell. The impact of its complex, dynamic morphology on its function as an intracellular transport hub remains poorly understood. To elucidate the functional consequences of ER network structure and dynamics, we quantify how the heterogeneity of the peripheral ER in COS7 cells affects diffusive protein transport. In vivo imaging of photoactivated ER membrane proteins demonstrates their nonuniform spreading to adjacent regions, in a manner consistent with simulations of diffusing particles on extracted network structures. Using a minimal network model to represent tubule rearrangements, we demonstrate that ER network dynamics are sufficiently slow to have little effect on diffusive protein transport. Furthermore, stochastic simulations reveal a novel consequence of ER network heterogeneity: the existence of "hot spots" where sparse diffusive reactants are more likely to find one another. ER exit sites, specialized domains regulating cargo export from the ER, are shown to be disproportionately located in highly accessible regions, further from the outer boundary of the cell. Combining in vivo experiments with analytic calculations, quantitative image analysis, and computational modeling, we demonstrate how structure guides diffusive protein transport and reactions in the ER.

Structure of the HIV immature lattice allows for essential lattice remodeling within budded virions

For HIV virions to become infectious, the immature lattice of Gag polyproteins attached to the virion membrane must be cleaved. Cleavage cannot initiate without the protease formed by the homo-dimerization of domains linked to Gag. However, only 5% of the Gag polyproteins, termed Gag-Pol, carry this protease domain, and they are embedded within the structured lattice. The mechanism of Gag-Pol dimerization is unknown. Here, we use spatial stochastic computer simulations of the immature Gag lattice as derived from experimental structures, showing that dynamics of the lattice on the membrane is unavoidable due to the missing 1/3 of the spherical protein coat. These dynamics allow for Gag-Pol molecules carrying the protease domains to detach and reattach at new places within the lattice. Surprisingly, dimerization timescales of minutes or less are achievable for realistic binding energies and rates despite retaining most of the large-scale lattice structure. We derive a formula allowing extrapolation of timescales as a function of interaction free energy and binding rate, thus predicting how additional stabilization of the lattice would impact dimerization times. We further show that during assembly, dimerization of Gag-Pol is highly likely and therefore must be actively suppressed to prevent early activation. By direct comparison to recent biochemical measurements within budded virions, we find that only moderately stable hexamer contacts (-12kBT<∆G<-8kBT) retain both the dynamics and lattice structures that are consistent with experiment. These dynamics are likely essential for proper maturation, and our models quantify and predict lattice dynamics and protease dimerization timescales that define a key step in understanding formation of infectious viruses.

Fluid-Solid Reaction in Porous Media as a Chaotic Restart Process

Chemical and biological reactions at fluid-solid interfaces are central to a broad range of porous material applications and research. Pore-scale solute transport limitations can reduce reaction rates, with marked consequences for a wide spectrum of natural and engineered processes. Recent advances show that chaotic mixing occurs spontaneously in porous media, but its impact on surface reactions is unknown. We show that pore-scale chaotic mixing significantly increases reaction efficiency compared to nonchaotic flows. We find that reaction rates are well described in terms of diffusive first-passage times of reactants to the solid interface subjected to a stochastic restart process resulting from Lagrangian chaos. Under chaotic mixing, the shear layer at no-slip interfaces sets the restart rate and leads to a characteristic scaling of reaction efficiency with Péclet number, in excellent agreement with numerical simulations. Reaction rates are insensitive to the flow topology as long as flow is chaotic, suggesting the relevance of this process to a broad range of porous materials.

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.

Encounter-based approach to the escape problem

We revise the encounter-based approach to imperfect diffusion-controlled reactions, which employs the statistics of encounters between a diffusing particle and the reactive region to implement surface reactions. We extend this approach to deal with a more general setting, in which the reactive region is surrounded by a reflecting boundary with an escape region. We derive a spectral expansion for the full propagator and investigate the behavior and probabilistic interpretations of the associated probability flux density. In particular, we obtain the joint probability density of the escape time and the number of encounters with the reactive region before escape, and the probability density of the first-crossing time of a prescribed number of encounters. We briefly discuss generalizations of the conventional Poissonian-type surface reaction mechanism described by Robin boundary condition and potential applications of this formalism in chemistry and biophysics.

Universal cover-time distribution of heterogeneous random walks

The cover-time problem, i.e., the time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk on complex structures has been a long-standing challenge and has attracted persistent efforts. Usually it is assumed that the random walk is noncompact, to facilitate theoretical treatments by neglecting the correlations between visits. The known results are essentially limited to noncompact and homogeneous systems, where different sites are on an equal footing and have identical or close mean first-passage times, such as random walks on a torus. In contrast, realistic random walks are prevailingly heterogeneous with diversified mean first-passage times. Does a universal distribution still exist? Here, by considering the most general situations of noncompact random walks, we uncover a generalized rescaling relation for the cover time, exploiting the diversified mean first-passage times that have not been accounted for before. This allows us to concretely establish a universal distribution of the rescaled cover times for heterogeneous noncompact random walks, which turns out to be the Gumbel universality class that is ubiquitous for a large family of extreme value statistics. Our analysis is based on the transfer matrix framework, which is generic in that, besides heterogeneity, it is also robust against biased protocols, directed links, and self-connecting loops. The finding is corroborated with extensive numerical simulations of diverse heterogeneous noncompact random walks on both model and realistic topological structures. Our technical ingredient may be exploited for other extreme value or ergodicity problems with nonidentical distributions.

Diffusive exit rates through pores in membrane-enclosed structures

The function of many membrane-enclosed intracellular structures relies on release of diffusing particles that exit through narrow pores or channels in the membrane. The rate of release varies with pore size, density, and length of the channel. We propose a simple approximate model, validated with stochastic simulations, for estimating the effective release rate from cylinders, and other simple-shaped domains, as a function of channel parameters. The results demonstrate that, for very small pores, a low density of channels scattered over the boundary is sufficient to achieve substantial rates of particle release. Furthermore, we show that increasing the length of passive channels will both reduce release rates and lead to a less steep dependence on channel density. Our results are compared to previously-measured local calcium release rates from tubules of the endoplasmic reticulum, providing an estimate of the relevant channel density responsible for the observed calcium efflux.

Theoretical insights into the full description of DNA target search by subdiffusing proteins

DNA binding proteins (DBPs) diffuse in the cytoplasm to recognise and bind with their respective target sites on the DNA to initiate several biologically important processes. The first passage time distributions (FPTDs) of DBPs are useful in quantifying the timescales of the most-probable search paths in addition to the mean value of the distribution which, strikingly, are decades of order apart in time. However, extremely crowded in vivo conditions or the viscoelasticity of the cellular medium among other factors causes biomolecules to exhibit anomalous diffusion which is usually overlooked in most theoretical studies. We have obtained approximate analytical expressions of a general FPTD and the two characteristic timescales that are valid for any single subdiffusing protein searching for its target in vivo. Our results can be applied to single-particle tracking experiments of target search.

Encounter-based approach to diffusion with resetting

An encounter-based approach consists in using the boundary local time as a proxy for the number of encounters between a diffusing particle and a target to implement various surface reaction mechanisms on that target. In this paper, we investigate the effects of stochastic resetting onto diffusion-controlled reactions in bounded confining domains. We first discuss the effect of position resetting onto the propagator and related quantities; in this way, we retrieve a number of earlier results but also provide complementary insights into them. Second, we introduce boundary local time resetting and investigate its impact. Curiously, we find that this type of resetting does not alter the conventional propagator governing the diffusive dynamics in the presence of a partially reactive target with a constant reactivity. In turn, the generalized propagator for other surface reaction mechanisms can be significantly affected. Our general results are illustrated for diffusion on an interval with reactive end points. Further perspectives and some open problems are discussed.

Everlasting impact of initial perturbations on first-passage times of non-Markovian random walks

Persistence, defined as the probability that a signal has not reached a threshold up to a given observation time, plays a crucial role in the theory of random processes. Often, persistence decays algebraically with time with non trivial exponents. However, general analytical methods to calculate persistence exponents cannot be applied to the ubiquitous case of non-Markovian systems relaxing transiently after an imposed initial perturbation. Here, we introduce a theoretical framework that enables the non-perturbative determination of persistence exponents of Gaussian non-Markovian processes with non stationary dynamics relaxing to a steady state after an initial perturbation. Two situations are analyzed: either the system is subjected to a temperature quench at initial time, or its past trajectory is assumed to have been observed and thus known. Our theory covers the case of spatial dimension higher than one, opening the way to characterize non-trivial reaction kinetics for complex systems with non-equilibrium initial conditions.

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.

Generalized fluctuation-dissipation theorem for non-Markovian reaction networks

Intracellular biochemical networks often display large fluctuations in the molecule numbers or the concentrations of reactive species, making molecular approaches necessary for system descriptions. For Markovian reaction networks, the fluctuation-dissipation theorem (FDT) has been well established and extensively used in fast evaluation of fluctuations in reactive species. For non-Markovian reaction networks, however, the similar FDT has not been established so far. Here, we present a generalized FDT (gFDT) for a large class of non-Markovian reaction networks where general intrinsic-event waiting-time distributions account for the effect of intrinsic noise and general stochastic reaction delays represent the impact of extrinsic noise from environmental perturbations. The starting point is a generalized chemical master equation (gCME), which describes the probabilistic behavior of an equivalent Markovian reaction network and identifies the structure of the original non-Markovian reaction network in terms of stoichiometries and effective transition rates (extensions of common reaction propensity functions). From this formulation follows directly the solution of the linear noise approximation of the stationary gCME for all the components in the non-Markovian reaction network. While the gFDT can quickly trace noisy sources in non-Markovian reaction networks, example analysis verifies its effectiveness.

Mean first-passage time to a small absorbing target in three-dimensional elongated domains

We derive an approximate formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape inside an elongated domain of a slowly varying axisymmetric profile. For this purpose, the original Poisson equation in three dimensions is reduced to an effective one-dimensional problem on an interval with a semipermeable semiabsorbing membrane. The approximate formula captures correctly the dependence of the MFPT on the distance to the target, the radial profile of the domain, and the size and the shape of the target. This approximation is validated by Monte Carlo simulations.

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.

Diffusion in a disk with inclusion: Evaluating Green’s functions

We give exact Green’s functions in two space dimensions. We work in a scaled domain that is a circle of unit radius with a smaller circular “inclusion”, of radius a, removed, without restriction on the size or position of the inclusion. We consider the two cases where one of the two boundaries is absorbing and the other is reflecting. Given a particle with diffusivity D, in a circle with radius R, the mean time to reach the absorbing boundary is a function of the initial condition, given by the integral of Green’s function over the domain. We scale to a circle of unit radius, then transform to bipolar coordinates. We show the equivalence of two different series expansions, and obtain closed expressions that are not series expansions.

Mean trapping time for an arbitrary trap site on a class of fractal scale-free trees

Fractals are ubiquitous in nature and random walks on fractals have attracted lots of scientific attention in the past several years. In this work, we consider discrete random walks on a class of fractal scale-free trees (FST), whose topologies are controlled by two integer parameters (i.e., u≥2 and v≥1) and exhibit a wide range of topological properties by suitably varying the parameters u and v. The mean trapping time (MTT), referred to as T_{y}, which is the mean time it takes the walker to be absorbed by the trap fixed at site y of the FST, is addressed analytically on the FST, and the effects of the trap location y on the MTT for the FST and for the general trees are also analyzed. First, a method, which is based on the connection between the MTT and the effective resistances, to derive analytically T_{y} for an arbitrary site y of the FST is presented, and some examples are provided to show the effectiveness of the method. Then, we compare T_{y} for all the possible site y of the trees, and find the sites where T_{y} achieves the minimum (or maximum) on the FST. Finally, we analyze the effects of trap location on the MTT in general trees and find that the average path length (APL) from an arbitrary site to the trap is the decisive factor which dominates the difference in the MTTs for different trap locations on general trees. We find, for any tree, the MTT obtains the minimum (or maximum) at sites where the APL achieves the minimum (or maximum).

First-encounter time of two diffusing particles in two- and three-dimensional confinement

The statistics of the first-encounter time of diffusing particles changes drastically when they are placed under confinement. In the present work, we make use of Monte Carlo simulations to study the behavior of a two-particle system in two- and three-dimensional domains with reflecting boundaries. Based on the outcome of the simulations, we give a comprehensive overview of the behavior of the survival probability S(t) and the associated first-encounter time probability density H(t) over a broad time range spanning several decades. In addition, we provide numerical estimates and empirical formulas for the mean first-encounter time 〈T〉, as well as for the decay time T characterizing the monoexponential long-time decay of the survival probability. Based on the distance between the boundary and the center of mass of two particles, we obtain an empirical lower bound t_{B} for the time at which S(t) starts to significantly deviate from its counterpart for the no boundary case. Surprisingly, for small-sized particles, the dominant contribution to T depends only on the total diffusivity D=D_{1}+D_{2}, in sharp contrast to the one-dimensional case. This contribution can be related to the Wiener sausage generated by a fictitious Brownian particle with diffusivity D. In two dimensions, the first subleading contribution to T is found to depend weakly on the ratio D_{1}/D_{2}. We also investigate the slow-diffusion limit when D_{2}≪D_{1}, and we discuss the transition to the limit when one particle is a fixed target. Finally, we give some indications to anticipate when T can be expected to be a good approximation for 〈T〉.

Diffusion control in biochemical specificity

Biochemical specificity is critical in enzyme function, evolution, and engineering. Here we employ an established kinetic model to dissect the effects of reactant geometry and diffusion on product formation speed and accuracy in the presence of cognate (correct) and near-cognate (incorrect) substrates. Using this steady-state model for spherical geometries, we find that, for distinct kinetic regimes, the speed and accuracy of the reactions are optimized on different regions of the geometric landscape. From this model we deduce that accuracy can be strongly dependent on reactant geometric properties even for chemically limited reactions. Notably, substrates with a specific geometry and reactivity can be discriminated by the enzyme with higher efficacy than others through purely diffusive effects. For similar cognate and near-cognate substrate geometries (as is the case for polymerases or the ribosome), we observe that speed and accuracy are maximized in opposing regions of the geometric landscape. We also show that, in relevant environments, diffusive effects on accuracy can be substantial even far from extreme kinetic conditions. Finally, we find how reactant chemical discrimination and diffusion can be related to simultaneously optimize steady-state flux and accuracy. These results highlight how diffusion and geometry can be employed to enhance reaction speed and discrimination, and similarly how they impose fundamental restraints on these quantities.

Reversible target-binding kinetics of multiple impatient particles

Certain biochemical reactions can only be triggered after binding a sufficient number of particles to a specific target region such as an enzyme or a protein sensor. We investigate the distribution of the reaction time, i.e., the first instance when all independently diffusing particles are bound to the target. When each particle binds irreversibly, this is equivalent to the first-passage time of the slowest (last) particle. In turn, reversible binding to the target renders the problem much more challenging and drastically changes the distribution of the reaction time. We derive the exact solution of this problem and investigate the short-time and long-time asymptotic behaviors of the reaction time probability density. We also analyze how the mean reaction time depends on the unbinding rate and the number of particles. Our exact and asymptotic solutions are compared to Monte Carlo simulations.

First-passage statistics of colloids on fractals: Theory and experimental realization

In nature and technology, particle dynamics frequently occur in complex environments, for example in restricted geometries or crowded media. These dynamics have often been modeled invoking a fractal structure of the medium although the fractal structure was only indirectly inferred through the dynamics. Moreover, systematic studies have not yet been performed. Here, colloidal particles moving in a laser speckle pattern are used as a model system. In this case, the experimental observations can be reliably traced to the fractal structure of the underlying medium with an adjustable fractal dimension. First-passage time statistics reveal that the particles explore the speckle in a self-similar, fractal manner at least over four decades in time and on length scales up to 20 times the particle radius. The requirements for fractal diffusion to be applicable are laid out, and methods to extract the fractal dimension are established.

Morphology and Transport in Eukaryotic Cells

Transport of intracellular components relies on a variety of active and passive mechanisms, ranging from the diffusive spreading of small molecules over short distances to motor-driven motion across long distances. The cell-scale behavior of these mechanisms is fundamentally dependent on the morphology of the underlying cellular structures. Diffusion-limited reaction times can be qualitatively altered by the presence of occluding barriers or by confinement in complex architectures, such as those of reticulated organelles. Motor-driven transport is modulated by the architecture of cytoskeletal filaments that serve as transport highways. In this review, we discuss the impact of geometry on intracellular transport processes that fulfill a broad range of functional objectives, including delivery, distribution, and sorting of cellular components. By unraveling the interplay between morphology and transport efficiency, we aim to elucidate key structure-function relationships that govern the architecture of transport systems at the cellular scale. Expected final online publication date for the Annual Review of Biophysics, Volume 51 is May 2022. Please see http://www.annualreviews.org/page/journal/pubdates for revised estimates.

The transcription factor activity gradient (TAG) model: contemplating a contact-independent mechanism for enhancer-promoter communication

How distal cis-regulatory elements (e.g., enhancers) communicate with promoters remains an unresolved question of fundamental importance. Although transcription factors and cofactors are known to mediate this communication, the mechanism by which diffusible molecules relay regulatory information from one position to another along the chromosome is a biophysical puzzle-one that needs to be revisited in light of recent data that cannot easily fit into previous solutions. Here we propose a new model that diverges from the textbook enhancer-promoter looping paradigm and offer a synthesis of the literature to make a case for its plausibility, focusing on the coactivator p300.

Weak multivalent biomolecular interactions: a strength versus numbers tug of war with implications for phase partitioning

In this short Perspective, we discuss how recent dynamic live-cell imaging experiments have challenged our understanding of mechanisms driving functional molecular interactions in vivo. While we have generally considered the formation of functional biomolecular complexes as resulting from the stable assembly of two or more partner molecules, here we entertain the possibility that function may actually be maintained while molecules are rapidly exchanged within a complex. We postulate that at high effective concentrations, even very weak interactions can lead to strong binding site occupancy and thereby mediate function in a highly dynamic fashion. This new perspective in our definition of what represents a functional complex in living cells and in vivo could significantly alter how we define the nature of molecular transactions critical for mediating regulation in the cellular context. These less conventional principles also allow a broadening of the mechanistic options we should explore when interpreting essential biological processes such as gene regulation.

Self-propulsion and self-navigation: Activity is a precursor to jamming

Traffic jams are an everyday hindrance to transport and typically arise when many vehicles have the same or a similar destination. We show, however, that even when uniformly distributed in space and uncorrelated, targets have a crucial effect on transport. At modest densities an instability arises leading to jams with emergent correlations between the targets. By considering limiting cases of the dynamics which map onto active Brownian particles, we argue that motility induced phase separation is the precursor to jams. That is, jams are MIPS seeds that undergo an extra instability due to target accumulation. This provides a quantitative prediction of the onset density for jamming, and suggests how jamming might be delayed or prevented. We study the transition between jammed and flowing phase, and find that transport is most efficient on the cusp of jamming.

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.

Optimizing the First-Passage Process on a Class of Fractal Scale-Free Trees

First-passage processes on fractals are of particular importance since fractals are ubiquitous in nature, and first-passage processes are fundamental dynamic processes that have wide applications. The global mean first-passage time (GMFPT), which is the expected time for a walker (or a particle) to first reach the given target site while the probability distribution for the position of target site is uniform, is a useful indicator for the transport efficiency of the whole network. The smaller the GMFPT, the faster the mass is transported on the network. In this work, we consider the first-passage process on a class of fractal scale-free trees (FSTs), aiming at speeding up the first-passage process on the FSTs. Firstly, we analyze the global mean first-passage time (GMFPT) for unbiased random walks on the FSTs. Then we introduce proper weight, dominated by a parameter w (w > 0), to each edge of the FSTs and construct a biased random walks strategy based on these weights. Next, we analytically evaluated the GMFPT for biased random walks on the FSTs. The exact results of the GMFPT for unbiased and biased random walks on the FSTs are both obtained. Finally, we view the GMFPT as a function of parameter w and find the point where the GMFPT achieves its minimum. The exact result is obtained and a way to optimize and speed up the first-passage process on the FSTs is presented.

Deprotonation Dynamics of Guanine Radical Cations†

This review is dedicated to guanine radical cations (G⁺ )^· that are precursors to oxidatively generated damage to DNA. (G⁺ )^· are unstable in neutral aqueous solution and tend to lose a proton. The deprotonation process has been studied by time-resolved absorption experiments in which (G⁺ )^· radicals are produced either by an electron abstraction reaction, using an external oxidant, or by low-energy/low-intensity photoionization of DNA. Both the position of the released proton and the dynamics of the process depend on the secondary DNA structure. While deprotonation in duplex DNA leads to (G-H1)^· radicals, in guanine quadruplexes the (G-H2)^· analogs are observed. Deprotonation in monomeric guanosine proceeds with a time constant of ˜60 ns; in genomic DNA, it is completed within 2 µs; and in guanine quadruplexes, it spans from at least 30 ns to over 50 µs. Such a deprotonation dynamics in four-stranded structures, extended over more than three decades of times, is correlated with the anisotropic structure of DNA and the mobility of its hydration shell. In this case, commonly used second-order reaction models are inappropriate for its description.

Unified Approach to Gated Reactions on Networks

For two molecules to react they first have to meet. Yet, reaction times are rarely on par with the first-passage times that govern such molecular encounters. A prime reason for this discrepancy is stochastic transitions between reactive and nonreactive molecular states, which results in effective gating of product formation and altered reaction kinetics. To better understand this phenomenon we develop a unifying approach to gated reactions on networks. We first show that the mean and distribution of the gated reaction time can always be expressed in terms of ungated first-passage and return times. This relation between gated and ungated kinetics is then explored to reveal universal features of gated reactions. The latter are exemplified using a diverse set of case studies which are also used to expose the exotic kinetics that arises due to molecular gating.

The needle and the haystack: single molecule tracking to probe the transcription factor search in eukaryotes

Transcription factors (TFs) regulate transcription of their target genes by identifying and binding to regulatory regions of the genome among billions of potential non-specific decoy sites, a task that is often presented as a 'needle in the haystack' challenge. The TF search process is now well understood in bacteria, but its characterization in eukaryotes needs to account for the complex organization of the nuclear environment. Here we review how live-cell single molecule tracking is starting to shed light on the TF search mechanism in the eukaryotic cell and we outline the future challenges to tackle in order to understand how nuclear organization modulates the TF search process in physiological and pathological conditions.

Diffusive search and trajectories on tubular networks: a propagator approach

Several organelles in eukaryotic cells, including mitochondria and the endoplasmic reticulum, form interconnected tubule networks extending throughout the cell. These tubular networks host many biochemical pathways that rely on proteins diffusively searching through the network to encounter binding partners or localized target regions. Predicting the behavior of such pathways requires a quantitative understanding of how confinement to a reticulated structure modulates reaction kinetics. In this work, we develop both exact analytical methods to compute mean first passage times and efficient kinetic Monte Carlo algorithms to simulate trajectories of particles diffusing in a tubular network. Our approach leverages exact propagator functions for the distribution of transition times between network nodes and allows large simulation time steps determined by the network structure. The methodology is applied to both synthetic planar networks and organelle network structures, demonstrating key general features such as the heterogeneity of search times in different network regions and the functional advantage of broadly distributing target sites throughout the network. The proposed algorithms pave the way for future exploration of the interrelationship between tubular network structure and biomolecular reaction kinetics.

Speed limits of protein assembly with reversible membrane localization

Protein assembly is often studied in a three-dimensional solution, but a significant fraction of binding events involve proteins that can reversibly bind and diffuse along a two-dimensional surface. In a recent study, we quantified how proteins can exploit the reduced dimensionality of the membrane to trigger complex formation. Here, we derive a single expression for the characteristic timescale of this multi-step assembly process, where the change in dimensionality renders rates and concentrations effectively time-dependent. We find that proteins can accelerate dimer formation due to an increase in relative concentration, driving more frequent collisions, which often win out over slow-downs due to diffusion. Our model contains two protein populations that dimerize with one another and use a distinct site to bind membrane lipids, creating a complex reaction network. However, by identifying two major rate-limiting pathways to reach an equilibrium steady-state, we derive an excellent approximation for the mean first passage time when lipids are in abundant supply. Our theory highlights how the "sticking rate" or effective adsorption coefficient of the membrane is central in controlling timescales. We also derive a corrected localization rate to quantify how the geometry of the system and diffusion can reduce rates of membrane localization. We validate and test our results using kinetic and particle-based reaction-diffusion simulations. Our results establish how the speed of key assembly steps can shift by orders-of-magnitude when membrane localization is possible, which is critical to understanding mechanisms used in cells.

Distribution of the span of one-dimensional confined random processes before hitting a target

We derive the distribution of the number of distinct sites visited by a random walker before hitting a target site of a finite one-dimensional (1D) domain. Our approach holds for the general class of Markovian processes with connected span-i.e., whose trajectories have no "holes." We show that the distribution can be simply expressed in terms of splitting probabilities only. We provide explicit results for classical examples of random processes with relevance to target search problems, such as simple symmetric random walks, biased random walks, persistent random walks, and resetting random walks. As a by-product, explicit expressions for the splitting probabilities of all these processes are given. Extensions to reflecting boundary conditions, continuous processes, and an example of a random process with a nonconnected span are discussed.