Intrinsic Complexity And Scaling Laws: From Random Fields to Random Vectors

by   Jennifer Bryson, et al.
University of California, Irvine

Random fields are commonly used for modeling of spatially (or timely) dependent stochastic processes. In this study, we provide a characterization of the intrinsic complexity of a random field in terms of its second order statistics, e.g., the covariance function, based on the Karhumen-Loéve expansion. We then show scaling laws for the intrinsic complexity of a random field in terms of the correlation length as it goes to 0. In the discrete setting, it becomes approximate embeddings of a set of random vectors. We provide a precise scaling law when the random vectors have independent and identically distributed entires using random matrix theory as well as when the random vectors has a specific covariance structure.


page 1

page 2

page 3

page 4


Cramér Type Moderate Deviations for Random Fields

We study the Cramér type moderate deviation for partial sums of random f...

Scaling priors in two dimensions for Intrinsic Gaussian MarkovRandom Fields

Intrinsic Gaussian Markov Random Fields (IGMRFs) can be used to induce c...

Local, algebraic simplifications of Gaussian random fields

Many applications of Gaussian random fields and Gaussian random processe...

Introduction to Random Fields

General linear models (GLM) are often constructed and used in statistica...

The Underlying Scaling Laws and Universal Statistical Structure of Complex Datasets

We study universal traits which emerge both in real-world complex datase...

Simulating space-time random fields with nonseparable Gneiting-type covariance functions

Two algorithms are proposed to simulate space-time Gaussian random field...

Modelling Distributed Shape Priors by Gibbs Random Fields of Second Order

We analyse the potential of Gibbs Random Fields for shape prior modellin...

Please sign up or login with your details

Forgot password? Click here to reset