The subdiffusive target problem: Survival probability

The asymptotic survival probability of a spherical target in the presence of a single subdiffusive trap or surrounded by a sea of subdiffusive traps in a continuous Euclidean medium is calculated. In one and two dimensions the survival probability of the target in the presence of a single trap decays to zero as a power law and as a power law with logarithmic correction, respectively. The target is thus reached with certainty, but it takes the trap an infinite time on average to do so. In three dimensions a single trap may never reach the target and so the survival probability is finite and, in fact, does not depend on whether the traps move diffusively or subdiffusively. When the target is surrounded by a sea of traps, on the other hand, its survival probability decays as a stretched exponential in all dimensions (with a logarithmic correction in the exponent for $d=2$). A trap will therefore reach the target with certainty, and will do so in a finite time. These results may be directly related to enzyme binding kinetics on DNA in the crowded cellular environment.Comment: 6 pages. References added, improved account of previous results and typos correcte

Optimal search strategies of space-time coupled random walkers with finite lifetimes

We present a simple paradigm for detection of an immobile target by a space-time coupled random walker with a finite lifetime. The motion of the walker is characterized by linear displacements at a fixed speed and exponentially distributed duration, interrupted by random changes in the direction of motion and resumption of motion in the new direction with the same speed. We call these walkers "mortal creepers". A mortal creeper may die at any time during its motion according to an exponential decay law characterized by a finite mean death rate $\omega_m$. While still alive, the creeper has a finite mean frequency $\omega$ of change of the direction of motion. In particular, we consider the efficiency of the target search process, characterized by the probability that the creeper will eventually detect the target. Analytic results confirmed by numerical results show that there is an $\omega_m$-dependent optimal frequency $\omega=\omega_{opt}$ that maximizes the probability of eventual target detection. We work primarily in one-dimensional ($d=1$) domains and examine the role of initial conditions and of finite domain sizes. Numerical results in $d=2$ domains confirm the existence of an optimal frequency of change of direction, thereby suggesting that the observed effects are robust to changes in dimensionality. In the $d=1$ case, explicit expressions for the probability of target detection in the long time limit are given. In the case of an infinite domain, we compute the detection probability for arbitrary times and study its early- and late-time behavior. We further consider the survival probability of the target in the presence of many independent creepers beginning their motion at the same location and at the same time. We also consider a version of the standard "target problem" in which many creepers start at random locations at the same time.Comment: 18 pages, 7 figures. The title has been changed with respect to the one in the previous versio

Universality of efficiency at maximum power

We investigate the efficiency of power generation by thermo-chemical engines. For strong coupling between the particle and heat flows and in the presence of a left-right symmetry in the system, we demonstrate that the efficiency at maximum power displays universality up to quadratic order in the deviation from equilibrium. A maser model is presented to illustrate our argument.Comment: 4 pages, 2 figure