skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Statistical non-locality of dynamically coherent structures
We analyse a class of stochastic advection problems by conditionally averaging the passive tracer equation with respect to a given flow state. In doing so, we obtain expressions for the turbulent diffusivity as a function of the flow statistics spectrum. When flow statistics are given by a continuous-time Markov process with a finite state space, calculations are amenable to analytic treatment. When the flow statistics are more complex, we show how to approximate turbulent fluxes as hierarchies of finite state space continuous-time Markov processes. The ensemble average turbulent flux is expressed as a linear operator that acts on the ensemble average of the tracer. We recover the classical estimate of turbulent flux as a diffusivity tensor, the components of which are the integrated autocorrelation of the velocity field in the limit that the operator becomes local in space and time.  more » « less
Award ID(s):
2124210
PAR ID:
10648339
Author(s) / Creator(s):
; ;
Publisher / Repository:
Cambridge University Press
Date Published:
Journal Name:
Journal of Fluid Mechanics
Volume:
966
ISSN:
0022-1120
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract We describe a process called “squeeze dispersion” in which the squeezing of oceanic tracer gradients by waves, eddies, and bathymetric flow modulates diapycnal diffusion by centimeter to meter‐scale turbulence. Due to squeeze dispersion, the effective diapycnal diffusivity of oceanic tracers is different and typically greater than the average “local” diffusivity, especially when local diffusivity correlates with squeezing. We develop a theory to quantify the effects of squeeze dispersion on diapycnal oceanic transport, finding formulas that connect density‐averaged tracer flux, locally measured diffusivity, large‐scale oceanic strain, the thickness‐weighted average buoyancy gradient, and the effective diffusivity of oceanic tracers. We use this effective diffusivity to interpret observations of abyssal flow through the Samoan Passage reported by Alford et al. (2013,https://doi.org/10.1002/grl.50684) and find that squeezing modulates diapycnal tracer dispersion by factors between 0.5 and 3. 
    more » « less
  2. The parameterization of fluxes associated with representing unresolved dynamics in turbulent flows, especially in the atmosphere and ocean (which have a vast range of scales), remains a challenging task. This is especially true for Earth system models including complex biogeochemistry and requiring very long simulations. The problem of representing the dependence of the mean flux of a passive tracer in terms of the mean has a very long history; in this study, we take a somewhat different approach. We use a formalism showing that the mean flux will be a functional of the mean gradients, a formalism that can be used to calculate the structure of the functional which is non-local in both space and time. Two-dimensional turbulent simulations are used to explore the weight of nearby (in space or time) gradients. We also use stochastic velocities and iterated maps to show that the results are similar. The functional formalism provides an understanding of when non-locality needs to be considered and when a local eddy diffusivity can be a reasonably good approximation. Furthermore, the formalism provides guidance for the development of data-driven parameterizations. 
    more » « less
  3. This paper contributes to the emerging viewpoint that governing equations for dynamic state estimation, conditioned on the history of noisy measurements, can be viewed as gradient flow on the manifold of joint probability density functions with respect to suitable metrics. Herein, we focus on the Wonham filter where the prior dynamics is given by a continuous time Markov chain on a finite state space; the measurement model includes noisy observation of the (possibly nonlinear function of) state. We establish that the posterior flow given by the Wonham filter can be viewed as the small time-step limit of proximal recursions of certain functionals on the probability simplex. The results of this paper extend our earlier work where similar proximal recursions were derived for the Kalman-Bucy filter. 
    more » « less
  4. We consider model-free reinforcement learning for infinite-horizon discounted Markov Decision Processes (MDPs) with a continuous state space and unknown transition kernel, when only a single sample path under an arbitrary policy of the system is available. We consider the Nearest Neighbor Q-Learning (NNQL) algorithm to learn the optimal Q function using nearest neighbor regression method. As the main contribution, we provide tight finite sample analysis of the convergence rate. In particular, for MDPs with a d-dimensional state space and the discounted factor in (0, 1), given an arbitrary sample path with “covering time” L, we establish that the algorithm is guaranteed to output an "-accurate estimate of the optimal Q-function nearly optimal sample complexity. 
    more » « less
  5. In this paper, we propose an approximate rela- tive value learning (ARVL) algorithm for non- parametric MDPs with continuous state space and finite actions and average reward criterion. It is a sampling based algorithm combined with kernel density estimation and function approx- imation via nearest neighbors. The theoreti- cal analysis is done via a random contraction operator framework and stochastic dominance argument. This is the first such algorithm for continuous state space MDPs with average re- ward criteria with these provable properties which does not require any discretization of state space as far as we know. We then eval- uate the proposed algorithm on a benchmark problem numerically. 
    more » « less