SearcharxivSearch

arXiv subjects

O. Benichou

Publications and source records attributed to O. Benichou.

At least 19 recordsLinked to original sources

A unifying representation of path integrals for fractional Brownian motions

Fractional Brownian motion (fBm) is an experimentally-relevant, non-Markovian Gaussian stochastic process with long-ranged correlations between the increments, parametrised by the so-called Hurst exponent $H$; depending on its value the process can be sub-diffusive $(0 < H < 1/2)$, diffusive $(H = 1/2)$ or super-diffusive $(1/2 < H < 1)$. There exist three alternative equally often used definitions of fBm -- due to Lévy and due to Mandelbrot and van Ness (MvN), which differ by the interval on which the time variable is formally defined. Respectively, the covariance functions of these fBms have different functional forms. Moreover, the MvN fBms have stationary increments, while for the Lévy fBm this is not the case. One may therefore be tempted to conclude that these are, in fact, different processes which only accidentally bear the same name. Recently determined explicit path integral representations also appear to have very different functional forms, which only reinforces the latter conclusion. Here we develope a unifying equivalent path integral representation of all three fBms in terms of Riemann-Liouville fractional integrals, which links the fBms and proves that they indeed belong to the same family. We show that the action in such a representation involves the fractional integral of the same form and order (dependent on whether $H < 1/2$ or $H > 1/2$) for all three cases, and differs only by the integration limits.

cond-mat.stat-mech

Tracer diffusion in crowded narrow channels. Topical review

We summarise different results on the diffusion of a tracer particle in lattice gases of hard-core particles with stochastic dynamics, which are confined to narrow channels -- single-files, comb-like structures and quasi-one-dimensional channels with the width equal to several particle diameters. We show that in such geometries a surprisingly rich, sometimes even counter-intuitive, behaviour emerges, which is absent in unbounded systems. We also present a survey of different results obtained for a tracer particle diffusion in unbounded systems, which will permit a reader to have an exhaustively broad picture of the tracer diffusion in crowded environments.

cond-mat.stat-mech

Optimally Frugal Foraging

We introduce the \emph{frugal foraging} model in which a forager performs a discrete-time random walk on a lattice, where each site initially contains $\mathcal{S}$ food units. The forager metabolizes one unit of food at each step and starves to death when it last ate $\mathcal{S}$ steps in the past. Whenever the forager decides to eat, it consumes all food at its current site and this site remains empty (no food replenishment). The crucial property of the forager is that it is \emph{frugal} and eats only when encountering food within at most $k$ steps of starvation. We compute the average lifetime analytically as a function of frugality threshold and show that there exists an optimal strategy, namely, a frugality threshold $k^*$ that maximizes the forager lifetime.

physics.soc-ph

Starvation Dynamics of a Greedy Forager

We investigate the dynamics of a greedy forager that moves by random walking in an environment where each site initially contains one unit of food. Upon encountering a food-containing site, the forager eats all the food there and can subsequently hop an additional $\mathcal{S}$ steps without food before starving to death. Upon encountering an empty site, the forager goes hungry and comes one time unit closer to starvation. We investigate the new feature of forager greed; if the forager has a choice between hopping to an empty site or to a food-containing site in its nearest neighborhood, it hops preferentially towards food. If the neighboring sites all contain food or are all empty, the forager hops equiprobably to one of these neighbors. Paradoxically, the lifetime of the forager can depend non-monotonically on greed, and the sense of the non-monotonicity is opposite in one and two dimensions. Even more unexpectedly, the forager lifetime in one dimension is substantially enhanced when the greed is negative; here the forager tends to avoid food in its local neighborhood. We also determine the average amount of food consumed at the instant when the forager starves. We present analytic, heuristic, and numerical results to elucidate these intriguing phenomena.

q-bio.PE

Does Greed Help a Forager Survive?

We investigate the role of greed on the lifetime of a random-walking forager on an initially resource-rich lattice. Whenever the forager lands on a food-containing site, all the food there is eaten and the forager can hop $\mathcal{S}$ more steps without food before starving. Upon reaching an empty site, the forager comes one time unit closer to starvation. The forager is also greedy---given a choice to move to an empty or to a food-containing site in its local neighborhood, the forager moves preferentially towards food. Surprisingly, the forager lifetime varies non-monotonically with greed, with different senses of the non-monotonicity in one and two dimensions. Also unexpectedly, the forager lifetime in one dimension has a huge peak for very negative greed.

q-bio.PE

Random Search with Memory in Patchy Media: Exploration-Exploitation Tradeoff

How to best exploit patchy resources? This long-standing question belongs to the extensively studied class of explore/exploit problems that arise in a wide range of situations, from animal foraging, to robotic exploration, and to human decision processes. Despite its broad relevance, the issue of optimal exploitation has previously only been tackled through two paradigmatic limiting models---patch-use and random search---that do not account for the interplay between searcher motion within patches and resource depletion. Here, we bridge this gap by introducing a minimal patch exploitation model that incorporates this coupling: the searcher depletes the resources along its random-walk trajectory within a patch and travels to a new patch after it takes $\mathcal{S}$ consecutive steps without finding resources. We compute the distribution of the amount of resources $F_t$ consumed by time $t$ for this non-Markovian random walker and show that exploring multiple patches is beneficial. In one dimension, we analytically derive the optimal strategy to maximize $F_t$. We show that this strategy is robust with respect to the distribution of resources within patches and the criterion for leaving a given patch. We also show that $F_t$ can be optimized in the ecologically-relevant case of two-dimensional patchy environments.

q-bio.PE

Joint distributions of partial and global maxima of a Brownian Bridge

We analyze the joint distributions and temporal correlations between the partial maximum $m$ and the global maximum $M$ achieved by a Brownian Bridge on the subinterval $[0,t_1]$ and on the entire interval $[0,t]$, respectively. We determine three probability distribution functions: The joint distribution $P(m,M)$ of both maxima; the distribution $P(m)$ of the partial maximum; and the distribution $Π(G)$ of the gap between the maxima, $G = M-m$. We present exact results for the moments of these distributions and quantify the temporal correlations between $m$ and $M$ by calculating the Pearson correlation coefficient.

cond-mat.stat-mech

Temporal correlations of the running maximum of a Brownian trajectory

We study the correlations between the maxima $m$ and $M$ of a Brownian motion (BM) on the time intervals $[0,t_1]$ and $[0,t_2]$, with $t_2>t_1$. We determine exact forms of the distribution functions $P(m,M)$ and $P(G = M - m)$, and calculate the moments $\mathbb{E}\{\left(M - m\right)^k\}$ and the cross-moments $\mathbb{E}\{m^l M^k\}$ with arbitrary integers $l$ and $k$. We show that correlations between $m$ and $M$ decay as $\sqrt{t_1/t_2}$ when $t_2/t_1 \to \infty$, revealing strong memory effects in the statistics of the BM maxima. We also compute the Pearson correlation coefficient $ρ(m,M)$, the power spectrum of $M_t$, and we discuss a possibility of extracting the ensemble-averaged diffusion coefficient in single-trajectory experiments using a single realization of the maximum process.

cond-mat.stat-mech

On the non-equivalence of two standard random walks

We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and the Montroll-Weiss continuous-time random walk in which the time intervals between successive steps are independent, exponentially and identically distributed random variables with mean 1. We show that while for symmetric random walks both models indeed lead to identical behaviour in the long time limit, when there is an external bias they lead to markedly different behaviour.

cond-mat.stat-mech

Facilitated diffusion of proteins on chromatin

We present a theoretical model of facilitated diffusion of proteins in the cell nucleus. This model, which takes into account the successive binding/unbinding events of proteins to DNA, relies on a fractal description of the chromatin which has been recently evidenced experimentally. Facilitated diffusion is shown quantitatively to be favorable for a fast localization of a target locus by a transcription factor, and even to enable the minimization of the search time by tuning the affinity of the transcription factor with DNA. This study shows the robustness of the facilitated diffusion mechanism, invoked so far only for linear conformations of DNA.

cond-mat.stat-mech

Exit and Occupation times for Brownian Motion on Graphs with General Drift and Diffusion Constant

We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each link. We establish the boundary conditions to be used at the vertices and we derive general expressions for the average time spent on a part of the graph before absorption and, also, for the Laplace transform of the joint law of the occupation times. Exit times distributions and splitting probabilities are also studied and several examples are discussed.

cond-mat.stat-mech

Probing microscopic origins of confined subdiffusion by first-passage observables

Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widepsread. This deviation from brownian motion is usually characterized by a sublinear time dependence of the mean square displacement (MSD). However, subdiffusive behavior can stem from different microscopic scenarios, which can not be identified solely by the MSD data. In this paper we present a theoretical framework which permits to calculate analytically first-passage observables (mean first-passage times, splitting probabilities and occupation times distributions) in disordered media in any dimensions. This analysis is applied to two representative microscopic models of subdiffusion: continuous-time random walks with heavy tailed waiting times, and diffusion on fractals. Our results show that first-passage observables provide tools to unambiguously discriminate between the two possible microscopic scenarios of subdiffusion. Moreover we suggest experiments based on first-passage observables which could help in determining the origin of subdiffusion in complex media such as living cells, and discuss the implications of anomalous transport to reaction kinetics in cells.

cond-mat.stat-mech

Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions

We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained distribution is exact, and completely explicit in the case or parallepipedic confining domains. We discuss implications of these results in two different fields: The mean first passage time for the random trap model is computed in dimensions greater than 1, and is shown to display a non-trivial dependence with the source and target positions ; The probability of reaction with a given imperfect center before being trapped by another one is also explicitly calculated, revealing a complex dependence both in geometrical and chemical parameters.

cond-mat.stat-mech

Survival probability of a particle in a sea of mobile traps: A tale of tails

We study the long-time tails of the survival probability $P(t)$ of an $A$ particle diffusing in $d$-dimensional media in the presence of a concentration $ρ$ of traps $B$ that move sub-diffusively, such that the mean square displacement of each trap grows as $t^γ$ with $0\leq γ\leq 1$. Starting from a continuous time random walk (CTRW) description of the motion of the particle and of the traps, we derive lower and upper bounds for $P(t)$ and show that for $γ\leq 2/(d+2)$ these bounds coincide asymptotically, thus determining asymptotically exact results. The asymptotic decay law in this regime is exactly that obtained for immobile traps. This means that for sufficiently subdiffusive traps, the moving $A$ particle sees the traps as essentially immobile, and Lifshitz or trapping tails remain unchanged. For $γ> 2/(d+2)$ and $d\leq 2$ the upper and lower bounds again coincide, leading to a decay law equal to that of a stationary particle. Thus, in this regime the moving traps see the particle as essentially immobile. For $d>2$, however, the upper and lower bounds in this $γ$ regime no longer coincide and the decay law for the survival probability of the $A$ particle remains ambiguous.

cond-mat.stat-mech

Enhanced reaction kinetics in biological cells

The cell cytoskeleton is a striking example of "active" medium driven out-of-equilibrium by ATP hydrolysis. Such activity has been shown recently to have a spectacular impact on the mechanical and rheological properties of the cellular medium, as well as on its transport properties : a generic tracer particle freely diffuses as in a standard equilibrium medium, but also intermittently binds with random interaction times to motor proteins, which perform active ballistic excursions along cytoskeletal filaments. Here, we propose for the first time an analytical model of transport limited reactions in active media, and show quantitatively how active transport can enhance reactivity for large enough tracers like vesicles. We derive analytically the average interaction time with motor proteins which optimizes the reaction rate, and reveal remarkable universal features of the optimal configuration. We discuss why active transport may be beneficial in various biological examples: cell cytoskeleton, membranes and lamellipodia, and tubular structures like axons.

cond-mat.stat-mech

The narrow escape problem revisited

The time needed for a particle to exit a confining domain through a small window, called the narrow escape time (NET), is a limiting factor of various processes, such as some biochemical reactions in cells. Obtaining an estimate of the mean NET for a given geometric environment is therefore a requisite step to quantify the reaction rate constant of such processes, which has raised a growing interest in the last few years. In this Letter, we determine explicitly the scaling dependence of the mean NET on both the volume of the confining domain and the starting point to aperture distance. We show that this analytical approach is applicable to a very wide range of stochastic processes, including anomalous diffusion or diffusion in the presence of an external force field, which cover situations of biological relevance.

cond-mat.stat-mech

Comment on "Localization Transition of Biased Random Walks on Random Networks"

Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph eventually reaches the target with probability 1 when b>b_c, while a finite fraction of walks drift off to infinity for b<b_c. They rely on rigorous results obtained for biased walks on Galton-Watson (GW) trees to calculate b_c, and give arguments indicating that this result should also hold for random graphs such as Erdos-Renyi (ER) graphs and Molloy-Reed (MR) graphs. To validate their prediction, they show by numerical simulations that the mean return time (MRT) on a finite ER graph, as a function of the graph size N, exhibits a transition around the expected b_c. Here we show that the MRT on a GW tree can actually be computed analytically. This allows us (i) to show analytically that indeed the MRT displays a transition at b_c, (ii) to elucidate the N dependence of the MRT, which contradicts the \propto N scaling expected in [Phys. Rev. Lett. 99, 098701 (2007)] for b<b_c.

cond-mat.stat-mech

First-passage times in complex scale-invariant media

How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations over the last decade1. The importance of FPTs originates from the crucial role played by first encounter properties in various real situations, including transport in disordered media, neuron firing dynamics, spreading of diseases or target search processes. Most methods to determine the FPT properties in confining domains have been limited to effective 1D geometries, or for space dimensions larger than one only to homogeneous media1. Here we propose a general theory which allows one to accurately evaluate the mean FPT (MFPT) in complex media. Remarkably, this analytical approach provides a universal scaling dependence of the MFPT on both the volume of the confining domain and the source-target distance. This analysis is applicable to a broad range of stochastic processes characterized by length scale invariant properties. Our theoretical predictions are confirmed by numerical simulations for several emblematic models of disordered media, fractals, anomalous diffusion and scale free networks.

cond-mat.stat-mech