Open Access
Refine
Language
- English (93)
Is part of the Bibliography
- yes (93)
Keywords
- anomalous diffusion (27)
- diffusion (9)
- living cells (9)
- infection pathway (5)
- random-walks (5)
- single-particle tracking (5)
- stochastic processes (5)
- ageing (4)
- dynamics (4)
- nonergodicity (4)
Institute
“A chain is only as strong as its weakest link” says the proverb. But what about a collection of statistically identical chains: How long till all chains fail? The answer to this question is given by the max-min of a matrix whose (i,j)entry is the failure time of link j of chain i: take the minimum of each row, and then the maximum of the rows' minima. The corresponding min-max is obtained by taking the maximum of each column, and then the minimum of the columns' maxima. The min-max applies to the storage of critical data. Indeed, consider multiple backup copies of a set of critical data items, and consider the (i,j) matrix entry to be the time at which item j on copy i is lost; then, the min-max is the time at which the first critical data item is lost. In this paper we address random matrices whose entries are independent and identically distributed random variables. We establish Poisson-process limit laws for the row's minima and for the columns' maxima. Then, we further establish Gumbel limit laws for the max-min and for the min-max. The limit laws hold whenever the entries' distribution has a density, and yield highly applicable approximation tools and design tools for the max-min and min-max of large random matrices. A brief of the results presented herein is given in: Gumbel central limit theorem for max-min and min-max
The max-min and min-max of matrices arise prevalently in science and engineering. However, in many real-world situations the computation of the max-min and min-max is challenging as matrices are large and full information about their entries is lacking. Here we take a statistical-physics approach and establish limit laws—akin to the central limit theorem—for the max-min and min-max of large random matrices. The limit laws intertwine random-matrix theory and extreme-value theory, couple the matrix dimensions geometrically, and assert that Gumbel statistics emerge irrespective of the matrix entries' distribution. Due to their generality and universality, as well as their practicality, these results are expected to have a host of applications in the physical sciences and beyond.
Transport in exclusion processes with one-step memory: density dependence and optimal acceleration
(2019)
We study a lattice gas of persistent walkers, in which each site is occupied by at most one particle and the direction each particle attempts to move to depends on its last step. We analyse the mean squared displacement (MSD) of the particles as a function of the particle density and their persistence (the tendency to continue moving in the same direction). For positive persistence the MSD behaves as expected: it increases with the persistence and decreases with the density. However, for strong anti-persistence we find two different regimes, in which the dependence of the MSD on the density is non-monotonic. For very strong anti-persistence there is an optimal density at which the MSD reaches a maximum. In an intermediate regime, the MSD as a function of the density exhibits both a minimum and a maximum, a phenomenon which has not been observed before. We derive a mean-field theory which qualitatively explains this behaviour.
For both Lévy flight and Lévy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given distance from its initial position for the first time, or when it lands at a given point for the first time. For Lévy motions with their propensity for long relocation events and thus the possibility to jump across a given point in space without actually hitting it ('leapovers'), these two definitions lead to significantly different results. We study the first-passage and first-hitting time distributions as functions of the Lévy stable index, highlighting the different behaviour for the cases when the first absolute moment of the jump length distribution is finite or infinite. In particular we examine the limits of short and long times. Our results will find their application in the mathematical modelling of random search processes as well as computer algorithms.
We investigate anomalous diffusion processes governed by the fractional Langevin equation and confined to a finite or semi-infinite interval by reflecting potential barriers. As the random and damping forces in the fractional Langevin equation fulfill the appropriate fluctuation-dissipation relation, the probability density on a finite interval converges for long times towards the expected uniform distribution prescribed by thermal equilibrium. In contrast, on a semi-infinite interval with a reflecting wall at the origin, the probability density shows pronounced deviations from the Gaussian behavior observed for normal diffusion. If the correlations of the random force are persistent (positive), particles accumulate at the reflecting wall while antipersistent (negative) correlations lead to a depletion of particles near the wall. We compare and contrast these results with the strong accumulation and depletion effects recently observed for nonthermal fractional Brownian motion with reflecting walls, and we discuss broader implications.
Brownian motion and beyond: first-passage, power spectrum, non-Gaussianity, and anomalous diffusion
(2019)
Brownian motion is a ubiquitous physical phenomenon across the sciences. After its discovery by Brown and intensive study since the first half of the 20th century, many different aspects of Brownian motion and stochastic processes in general have been addressed in Statistical Physics. In particular, there now exists a very large range of applications of stochastic processes in various disciplines. Here we provide a summary of some of the recent developments in the field of stochastic processes, highlighting both the experimental findings and theoretical frameworks.
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 here study the first-passage time properties of Lévy flights in one-dimensional semi-infinite and bounded domains for symmetric and asymmetric jump length distributions. To obtain the full probability density function of first-passage times for these cases we employ two complementary methods. One approach is based on the space-fractional diffusion equation for the probability density function, from which the survival probability is obtained for different values of the stable index and the skewness (asymmetry) parameter . The other approach is based on the stochastic Langevin equation with -stable driving noise. Both methods have their advantages and disadvantages for explicit calculations and numerical evaluation, and the complementary approach involving both methods will be profitable for concrete applications. We also make use of the Skorokhod theorem for processes with independent increments and demonstrate that the numerical results are in good agreement with the analytical expressions for the probability density function of the first-passage times.
In the scenario of the narrow escape problem (NEP) a particle diffuses in a finite container and eventually leaves it through a small 'escape window' in the otherwise impermeable boundary, once it arrives to this window and crosses an entropic barrier at the entrance to it. This generic problem is mathematically identical to that of a diffusion-mediated reaction with a partially-reactive site on the container's boundary. Considerable knowledge is available on the dependence of the mean first-reaction time (FRT) on the pertinent parameters. We here go a distinct step further and derive the full FRT distribution for the NEP. We demonstrate that typical FRTs may be orders of magnitude shorter than the mean one, thus resulting in a strong defocusing of characteristic temporal scales. We unveil the geometry-control of the typical times, emphasising the role of the initial distance to the target as a decisive parameter. A crucial finding is the further FRT defocusing due to the barrier, necessitating repeated escape or reaction attempts interspersed with bulk excursions. These results add new perspectives and offer a broad comprehension of various features of the by-now classical NEP that are relevant for numerous biological and technological systems.
In the scenario of the narrow escape problem (NEP) a particle diffuses in a finite container and eventually leaves it through a small 'escape window' in the otherwise impermeable boundary, once it arrives to this window and crosses an entropic barrier at the entrance to it. This generic problem is mathematically identical to that of a diffusion-mediated reaction with a partially-reactive site on the container's boundary. Considerable knowledge is available on the dependence of the mean first-reaction time (FRT) on the pertinent parameters. We here go a distinct step further and derive the full FRT distribution for the NEP. We demonstrate that typical FRTs may be orders of magnitude shorter than the mean one, thus resulting in a strong defocusing of characteristic temporal scales. We unveil the geometry-control of the typical times, emphasising the role of the initial distance to the target as a decisive parameter. A crucial finding is the further FRT defocusing due to the barrier, necessitating repeated escape or reaction attempts interspersed with bulk excursions. These results add new perspectives and offer a broad comprehension of various features of the by-now classical NEP that are relevant for numerous biological and technological systems.