Search arXivSearch

arXiv · 2004.14994

Extreme statistics of anomalous subdiffusion following a fractional Fokker-Planck equation: Subdiffusion is faster than normal diffusion

Abstract

Anomalous subdiffusion characterizes transport in diverse physical systems and is especially prevalent inside biological cells. In cell biology, the prevailing model for chemical activation rates has recently changed from the first passage time (FPT) of a single searcher to the FPT of the fastest searcher out of many searchers to reach a target, which is called an extreme statistic or extreme FPT. In this paper, we investigate extreme statistics of searchers which move by anomalous subdiffusion. We model subdiffusion by a fractional Fokker-Planck equation involving the Riemann-Liouville fractional derivative. We prove an explicit and very general formula for every moment of subdiffusive extreme FPTs and approximate their full probability distribution. While the mean FPT of a single subdiffusive searcher is infinite, the fastest subdiffusive searcher out of many subdiffusive searchers typically has a finite mean FPT. In fact, we prove the counterintuitive result that extreme FPTs of subdiffusion are faster than extreme FPTs of normal diffusion. Mathematically, we employ a stochastic representation involving a random time change of a standard Ito drift-diffusion according to the trajectory of the first crossing time inverse of a Levy subordinator. A key step in our analysis is generalizing Varadhan's formula from large deviation theory to the case of subdiffusion, which yields the short-time distribution of subdiffusion in terms of a certain geodesic distance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean D Lawley. 2020-10-22. Extreme statistics of anomalous subdiffusion following a fractional Fokker-Planck equation: Subdiffusion is faster than normal diffusion. https://doi.org/10.1088/1751-8121%2Faba39c

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR