z-logo
Premium
Theory and generation of conditional, scalable sub‐ G aussian random fields
Author(s) -
Panzeri M.,
Riva M.,
Guadagnini A.,
Neuman S.P.
Publication year - 2016
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1002/2015wr018348
Subject(s) - gaussian , scaling , gaussian random field , statistical physics , isotropy , realization (probability) , random field , algorithm , mathematics , consistency (knowledge bases) , anisotropy , gaussian process , statistics , discrete mathematics , physics , geometry , optics , quantum mechanics
Many earth and environmental (as well as a host of other) variables, Y , and their spatial (or temporal) increments, Δ Y , exhibit non‐Gaussian statistical scaling. Previously we were able to capture key aspects of such non‐Gaussian scaling by treating Y and/or Δ Y as sub‐Gaussian random fields (or processes). This however left unaddressed the empirical finding that whereas sample frequency distributions of Y tend to display relatively mild non‐Gaussian peaks and tails, those of Δ Y often reveal peaks that grow sharper and tails that become heavier with decreasing separation distance or lag. Recently we proposed a generalized sub‐Gaussian model (GSG) which resolves this apparent inconsistency between the statistical scaling behaviors of observed variables and their increments. We presented an algorithm to generate unconditional random realizations of statistically isotropic or anisotropic GSG functions and illustrated it in two dimensions. Most importantly, we demonstrated the feasibility of estimating all parameters of a GSG model underlying a single realization of Y by analyzing jointly spatial moments of Y data and corresponding increments, Δ Y . Here, we extend our GSG model to account for noisy measurements of Y at a discrete set of points in space (or time), present an algorithm to generate conditional realizations of corresponding isotropic or anisotropic random fields, introduce two approximate versions of this algorithm to reduce CPU time, and explore them on one and two‐dimensional synthetic test cases.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here