Random field

In physics and mathematics, a random field is a random function over an arbitrary domain (usually a multi-dimensional space such as $\mathbb {R} ^{n}$ ). That is, it is a function $f(x)$ that takes on a random value at each point $x\in \mathbb {R} ^{n}$ (or some other domain). It is also sometimes thought of as a synonym for a stochastic process with some restriction on its index set. That is, by modern definitions, a random field is a generalization of a stochastic process where the underlying parameter need no longer be real or integer valued "time" but can instead take values that are multidimensional vectors or points on some manifold.^[1]

Formal definition

Given a probability space $(\Omega ,{\mathcal {F}},P)$ , an X-valued random field is a collection of X-valued random variables indexed by elements in a topological space T. That is, a random field F is a collection

\{F_{t}:t\in T\}

where each $F_{t}$ is an X-valued random variable.

Examples

In its discrete version, a random field is a list of random numbers whose indices are identified with a discrete set of points in a space (for example, n-dimensional Euclidean space). Suppose there are four random variables, $X_{1}$ , $X_{2}$ , $X_{3}$ , and $X_{4}$ , located in a 2D grid at (0,0), (0,2), (2,2), and (2,0), respectively. Suppose each random variable can take on the value of -1 or 1, and the probability of each random variable's value depends on its immediately adjacent neighbours. This is a simple example of a discrete random field.

More generally, the values each $X_{i}$ can take on might be defined over a continuous domain. In larger grids, it can also be useful to think of the random field as a "function valued" random variable as described above. In quantum field theory the notion is generalized to a random functional, one that takes on random values over a space of functions (see Feynman integral).

Several kinds of random fields exist, among them the Markov random field (MRF), Gibbs random field, conditional random field (CRF), and Gaussian random field. In 1974, Julian Besag proposed an approximation method relying on the relation between MRFs and Gibbs RFs.^{[citation needed]}

Example properties

An MRF exhibits the Markov property

P(X_{i}=x_{i}|X_{j}=x_{j},i\neq j)=P(X_{i}=x_{i}|X_{j}=x_{j},j\in \partial _{i}),\,

for each choice of values $(x_{j})_{j}$ . Here each $\partial _{i}$ is the set of neighbors of $i$ . In other words, the probability that a random variable assumes a value depends on its immediate neighboring random variables. The probability of a random variable in an MRF^{[clarification needed]} is given by

P(X_{i}=x_{i}|\partial _{i})={\frac {P(X_{i}=x_{i},\partial _{i})}{\sum _{k}P(X_{i}=k,\partial _{i})}},

where the sum (can be an integral) is over the possible values of k.^{[clarification needed]} It is sometimes difficult to compute this quantity exactly.

Applications

When used in the natural sciences, values in a random field are often spatially correlated. For example, adjacent values (i.e. values with adjacent indices) do not differ as much as values that are further apart. This is an example of a covariance structure, many different types of which may be modeled in a random field. One example is the Ising model where sometimes nearest neighbor interactions are only included as a simplification to better understand the model.

A common use of random fields is in the generation of computer graphics, particularly those that mimic natural surfaces such as water and earth. Random fields have been also used in subsurface ground models as in ^[2]

In neuroscience, particularly in task-related functional brain imaging studies using PET or fMRI, statistical analysis of random fields are one common alternative to correction for multiple comparisons to find regions with truly significant activation.^[3] More generally, random fields can be used to correct for the look-elsewhere effect in statistical testing, where the domain is the parameter space being searched.^[4]

They are also used in machine learning applications (see graphical models).

Tensor-valued random fields

Random fields are of great use in studying natural processes by the Monte Carlo method in which the random fields correspond to naturally spatially varying properties. This leads to tensor-valued random fields^{[clarification needed]} in which the key role is played by a statistical volume element (SVE), which is a spatial box over which properties can be averaged; when the SVE becomes sufficiently large, its properties become deterministic and one recovers the representative volume element (RVE) of deterministic continuum physics. The second type of random field that appears in continuum theories are those of dependent quantities (temperature, displacement, velocity, deformation, rotation, body and surface forces, stress, etc.).^[5]^{[clarification needed]}

References

^ Vanmarcke, Erik (2010). Random Fields: Analysis and Synthesis. World Scientific Publishing Company. ISBN 978-9812563538.
^ Cardenas, IC (2023). "A two-dimensional approach to quantify stratigraphic uncertainty from borehole data using non-homogeneous random fields". Engineering Geology. doi:10.1016/j.enggeo.2023.107001.
^ Worsley, K. J.; Evans, A. C.; Marrett, S.; Neelin, P. (November 1992). "A Three-Dimensional Statistical Analysis for CBF Activation Studies in Human Brain". Journal of Cerebral Blood Flow & Metabolism. 12 (6): 900–918. doi:10.1038/jcbfm.1992.127. ISSN 0271-678X. PMID 1400644.
^ Vitells, Ofer; Gross, Eilam (2011). "Estimating the significance of a signal in a multi-dimensional search". Astroparticle Physics. 35: 230–234. arXiv:1105.4355. doi:10.1016/j.astropartphys.2011.08.005.
^ Malyarenko, Anatoliy; Ostoja-Starzewski, Martin (2019). Tensor-Valued Random Fields for Continuum Physics. Cambridge University Press. ISBN 9781108429856.

v t e Stochastic processes
Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding Biased Maximal entropy
Continuous time	Additive process Bessel process Birth–death process pure birth Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Dyson Brownian motion Empirical process Feller process Fleming–Viot process Gamma process Geometric process Hawkes process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage
Both	Branching process Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process Stochastic chains with memory of variable length White noise
Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph
Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model
Financial models	Binomial options pricing model Black–Derman–Toy Black–Karasinski Black–Scholes Chan–Karolyi–Longstaff–Sanders (CKLS) Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White Korn-Kreer-Lenssen LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie
Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson
Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c
Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise-deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible
Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem Zero–one laws (Blumenthal, Borel–Cantelli, Engelbert–Schmidt, Hewitt–Savage, Kolmogorov, Lévy)
Inequalities	Burkholder–Davis–Gundy Doob's martingale Doob's upcrossing Kunita–Watanabe Marcinkiewicz–Zygmund
Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Karhunen–Loève theorem Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract
Disciplines	Actuarial mathematics Control theory Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Signal processing Statistics Stochastic analysis Time series analysis Machine learning
List of topics Category