We consider a particle which moves on the x axis and is subject to a constant force, such as gravity, plus a random force in the form of Gaussian white noise. We analyze the statistics of first arrival at point $x_1$ of a particle which starts at $x_0$ with velocity $v_0$. The probability that the particle has not yet arrived at $x_1$ after a time $t$, the mean time of first arrival, and the velocity distribution at first arrival are all considered. We also study the statistics of the first return of the particle to its starting point. Finally, we point out that the extreme-value statistics of the particle and the first-passage statistics are closely related, and we derive the distribution of the maximum displacement $m={\rm max}_t[x(t)]$.
We consider the statistical properties of arrival times and balls on first-passage percolation (FPP) $2D$ square lattices with strong disorder in the link-times. A previous work showed a crossover in the weak disorder regime, between Gaussian and Kardar-Parisi-Zhang (KPZ) universality, with the crossover length decreasing as the noise amplitude grows. On the other hand, this work presents a very different behavior in the strong-disorder regime. A new crossover length appears below which the model is described by bond-percolation universality class. This characteristic length scale grows with t…
Extreme value functionals of stochastic processes are inverse functionals of the first passage time -- a connection that renders their probability distribution functions equivalent. Here, we deepen this link and establish a framework for analyzing extreme value statistics of ergodic reversible Markov processes in confining potentials on the hand of the underlying relaxation eigenspectra. We derive a chain of inequalities, which bounds the long-time asymptotics of first passage densities, and thereby extrema, from above and from below. The bounds involve a time integral of the transition probab…
First passage under restart with branching is proposed as a generalization of first passage under restart. Strong motivation to study this generalization comes from the observation that restart with branching can expedite the completion of processes that cannot be expedited with simple restart; yet a sharp and quantitative formulation of this statement is still lacking. We develop a comprehensive theory of first passage under restart with branching. This reveals that two widely applied measures of statistical dispersion---the coefficient of variation and the Gini index---come together to deter…
We review the question of the extreme values attained by a random process. We relate it to level crossings either to one boundary (first-passage problems) and two boundaries (escape problems). The extremes studied are the maximum, the minimum, the maximum absolute value and the range or span. We specialize in diffusion processes and present detailed results for the Wiener and Feller processes.
We study the first-passage time, the distribution of the maximum, and the absorption probability of fractional Brownian motion of Hurst parameter $H$ with both a linear and a non-linear drift. The latter appears naturally when applying non-linear variable transformations. Via a perturbative expansion in $ε= H-1/2$, we give the first-order corrections to the classical result for Brownian motion analytically. Using a recently introduced adaptive bisection algorithm, which is much more efficient than the standard Davies-Harte algorithm, we test our predictions for the first-passage time on grids …
Long cell protrusions, which are effectively one-dimensional, are highly dynamic subcellular structures. Length of many such protrusions keep fluctuating about the mean value even in the the steady state. We develop here a stochastic model motivated by length fluctuations of a type of appendage of an eukaryotic cell called flagellum (also called cilium). Exploiting the techniques developed for the calculation of level-crossing statistics of random excursions of stochastic process, we have derived analytical expressions of passage times for hitting various thresholds, sojourn times of random ex…
Polygonal billiards are an example of pseudo-chaotic dynamics, a combination of integrable evolution and sudden jumps due to conical singular points that arise from the corners of the polygons. Such pseudo-chaotic behaviour, often characterised by an algebraic separation of nearby trajectories, is believed to be linked to the wild dependence that particle transport has on the fine details of the billiard table. Here we address this relation through a detailed numerical study of the statistics of displacement in a family of polygonal channel billiards with parallel walls. We show that transport…
We study statistics of first passage inside a cone in arbitrary spatial dimension. The probability that a diffusing particle avoids the cone boundary decays algebraically with time. The decay exponent depends on two variables: the opening angle of the cone and the spatial dimension. In four dimensions, we find an explicit expression for the exponent, and in general, we obtain it as a root of a transcendental equation involving associated Legendre functions. At large dimensions, the decay exponent depends on a single scaling variable, while roots of the parabolic cylinder function specify the s…
In these lecture notes I will discuss the universal first-passage properties of a simple correlated discrete-time sequence {x_0=0, x_1,x_2.... x_n} up to n steps where x_i represents the position at step i of a random walker hopping on a continuous line by drawing independently, at each time step, a random jump length from an arbitrary symmetric and continuous distribution (it includes, e.g., the Levy flights). I will focus on the statistics of two extreme observables associated with the sequence: (i) its global maximum and the time step at which the maximum occurs and (ii) the number of recor…
Finding representative reaction pathways is necessary for understanding mechanisms of molecular processes, but is considered to be extremely challenging. We propose a new method to construct reaction paths based on mean first-passage times. This approach incorporates information of all possible reaction events as well as the effect of temperature. The method is applied to exemplary reactions in a continuous and in a discrete setting. The suggested approach holds great promise for large reaction networks that are completely characterized by the method through a pathway graph.
In the random acceleration process, a point particle is accelerated according to $\ddot{x}=η(t)$, where the right hand side represents Gaussian white noise with zero mean. We begin with the case of a particle with initial position $x_0$ and initial velocity $v_0$ and review the statistics of its first arrival at the origin and its first return to the origin. Multiple returns to the origin, motion with a constant force in addition to a random force, and persistence properties for several boundary conditions at the origin are also considered. Next we review first-exit properties of a randomly ac…
Freidlin-Wentzell theory of large deviations can be used to compute the likelihood of extreme or rare events in stochastic dynamical systems via the solution of an optimization problem. The approach gives exponential estimates that often need to be refined via calculation of a prefactor. Here it is shown how to perform these computations in practice. Specifically, sharp asymptotic estimates are derived for expectations, probabilities, and mean first passage times in a form that is geared towards numerical purposes: they require solving well-posed matrix Riccati equations involving the minimize…
In this paper we address the problem of the calculation of the mean first passage time (MFPT) on generic graphs. We focus in particular on the mean first passage time on a node 's' for a random walker starting from a generic, unknown, node 'x'. We introduce an approximate scheme of calculation which maps the original process in a Markov process in the space of the so-called rings, described by a transition matrix of size O(ln N / ln<k> X ln N / ln<k>), where N is the size of the graph and <k> the average degree in the graph. In this way one has a drastic reduction of degrees of freedom with re…
Lévy Flights are paradigmatic generalised random walk processes, in which the independent stationary increments---the "jump lengths"---are drawn from an $α$-stable jump length distribution with long-tailed, power-law asymptote. As a result, the variance of Lévy Flights diverges and the trajectory is characterised by occasional extremely long jumps. Such long jumps significantly decrease the probability to revisit previous points of visitation, rendering Lévy Flights efficient search processes in one and two dimensions. To further quantify their precise property as random search strategies we h…
We study the statistics of last-passage time for linear diffusions. First we present an elementary derivation of the Laplace transform of the probability density of the last-passage time, thus recovering known results from the mathematical literature. We then illustrate them on several explicit examples. In a second step we study the spectral properties of the Schrödinger operator associated to such diffusions in an even potential $U(x) = U(-x)$, unveiling the role played by the so-called Weyl coefficient. Indeed, in this case, our approach allows us to relate the last-passage times for dual d…
Emergence of generic first-passage time distributions for large Markovian networks
University of Heidelberg（海德堡大学）；Institute for Theoretical Physics, University of Heidelberg（海德堡大学理论物理研究所）；BioQuant-Center for Quantitative Biology, University of Heidelberg（海德堡大学生物定量中心）
The cover-time problem, i.e., 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. Yet, the known results are essentially limited to 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 heteroge…
We study the dynamics of the passage of a stiff chain through a pore into a cell containing particles that bind reversibly to it. Using Brownian Molecular Dynamics simulations we investigate the mean-first-passage time as a function of the length of the chain inside, for different concentrations of binding particles. As a consequence of the interactions with these particles, the chain experiences a net force along its length whose calculated value from the simulations accounts for the velocity at which it enters the cell. This force can in turn be obtained from the solution of a generalized di…
We study here the extreme statistics of Brownian particles escaping from a cusp funnel: the fastest Brownian particles among $n$ follow an ensemble of optimal trajectories located near the shortest path from the source to the target. For the time of such first arrivers, we derive an asymptotic formula that differs from the classical narrow escape and dire strait obtained for the mean first passage time. Consequently, when particles are initially distributed at a given distance from a cusp, the fastest do see some properties characterizing the cusp geometry. Therefore, when many particles diffu…
We present an algorithm to efficiently sample first-passage times for fractional Brownian motion. To increase the resolution, an initial coarse lattice is successively refined close to the target, by adding exactly sampled midpoints, where the probability that they reach the target is non-negligible. Compared to a path of $N$ equally spaced points, the algorithm achieves the same numerical accuracy $N_{\rm eff}$, while sampling only a small fraction of all points. Though this induces a statistical error, the latter is bounded for each bridge, allowing us to bound the total error rate by a numb…
We study the statistics of infima, stopping times and passage probabilities of entropy production in nonequilibrium steady states, and show that they are universal. We consider two examples of stopping times: first-passage times of entropy production and waiting times of stochastic processes, which are the times when a system reaches for the first time a given state. Our main results are: (i) the distribution of the global infimum of entropy production is exponential with mean equal to minus Boltzmann's constant; (ii) we find the exact expressions for the passage probabilities of entropy produ…
This thesis presents original results in two domains of disordered statistical physics: logarithmic correlated Random Energy Models (logREMs), and localization transitions in long-range random matrices. In the first part devoted to logREMs, we show how to characterise their common properties and model--specific data. Then we develop their replica symmetry breaking treatment, which leads to the freezing scenario of their free energy distribution and the general description of their minima process, in terms of decorated Poisson point process. We also report a series of new applications of the Ja…
