SearcharxivSearch

arXiv · 1905.08707

Lagrangian uncertainty quantification and information inequalities for stochastic flows

Abstract

We develop a systematic information-theoretic framework for quantification and mitigation of error in probabilistic Lagrangian (i.e., path-based) predictions which are obtained from dynamical systems generated by uncertain (Eulerian) vector fields. This work is motivated by the desire to improve Lagrangian predictions in complex dynamical systems based either on analytically simplified or data-driven models. We derive a hierarchy of general information bounds on uncertainty in estimates of statistical observables $\mathbb{E}^{\nu}[f]$, evaluated on trajectories of the approximating dynamical system, relative to the "true'' observables $\mathbb{E}^{\mu}[f]$ in terms of certain $\varphi$-divergences, $\mathcal{D}_\varphi(\mu\|\nu)$, which quantify discrepancies between probability measures $\mu$ associated with the original dynamics and their approximations $\nu$. We then derive two distinct bounds on $\mathcal{D}_\varphi(\mu\|\nu)$ itself in terms of the Eulerian fields. This new framework provides a rigorous way for quantifying and mitigating uncertainty in Lagrangian predictions due to Eulerian model error.

Explore related subjects

Keep this discovery

BibTeXRIS

Michal Branicki, Kenneth Uda. 2019-05-21. Lagrangian uncertainty quantification and information inequalities for stochastic flows. https://arxiv.org/abs/1905.08707

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR