Math 2.0

Statistics Definition

Kriging

Builds on VariogramStochastic processExpected valueMean squared error

Definition

Let D⊆ℝdD \subseteq \R^d and let (Z(s))s∈D(Z(s))_{s \in D} be a real random field of the form Z(s)=μ+δ(s)Z(s) = \mu + \delta(s). Here μ\mu is an unknown constant and δ\delta is intrinsically stationary with variogram 2γ2\gamma and E[δ(s)]=0E[\delta(s)] = 0. Let s1,…,sn,s0∈Ds_1, \dots, s_n, s_0 \in D, and write γij=γ(si−sj)\gamma_{ij} = \gamma(s_i - s_j) for 0≤i,j≤n0 \le i, j \le n.

The ordinary kriging predictor of Z(s0)Z(s_0) is Z^(s0)=∑i=1nλiZ(si)\hat Z(s_0) = \sum_{i=1}^{n} \lambda_i Z(s_i), where the weights minimise the mean squared error E[(Z(s0)−Z^(s0))2]E[(Z(s_0) - \hat Z(s_0))^2] subject to ∑i=1nλi=1\sum_{i=1}^{n} \lambda_i = 1. Equivalently, λ1,…,λn\lambda_1, \dots, \lambda_n and a number mm solve the linear system ∑j=1nλjγij+m=γi0(1≤i≤n),∑j=1nλj=1.\sum_{j=1}^{n} \lambda_j \gamma_{ij} + m = \gamma_{i0} \quad (1 \le i \le n), \qquad \sum_{j=1}^{n} \lambda_j = 1.

Remarks

The constraint ∑iλi=1\sum_i \lambda_i = 1 makes the predictor unbiased, E[Z^(s0)]=μ=E[Z(s0)]E[\hat Z(s_0)] = \mu = E[Z(s_0)], whatever the value of μ\mu. The minimal mean squared error, the kriging variance, is ∑i=1nλiγi0+m\sum_{i=1}^{n} \lambda_i \gamma_{i0} + m. Simple kriging assumes μ\mu known and drops the constraint; universal kriging replaces μ\mu by a linear combination of known functions of ss.

Example: with one observation, n=1n = 1, the constraint forces λ1=1\lambda_1 = 1, so Z^(s0)=Z(s1)\hat Z(s_0) = Z(s_1). The first equation then gives m=γ10−γ11=γ(s1−s0)m = \gamma_{10} - \gamma_{11} = \gamma(s_1 - s_0), since γ(0)=0\gamma(0) = 0, so the kriging variance is 2γ(s1−s0)2\gamma(s_1 - s_0), which is indeed E[(Z(s0)−Z(s1))2]E[(Z(s_0) - Z(s_1))^2].

Non-example: inverse distance weighting also predicts by a weighted average with weights summing to 11. Its weights are fixed by the distances alone and do not minimise the mean squared error for the given variogram, so it is not kriging.

Reading path

To understand this page from the ground up, read these 43 pages in order. The foundations come first.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Expected value concept
  4. Integers object
  5. Mean squared error concept
  6. Ordered field definition
  7. Proposition concept
  8. Random experiment concept
  9. Rational numbers object
  10. Real numbers object
  11. Variogram concept
  12. Set definition
  13. Ring of integers statement
  14. Disjunction definition
  15. Implication definition
  16. Predicate definition
  17. Ordered pair definition
  18. Union definition
  19. Sample space definition
  20. Existential quantifier definition
  21. Universal quantifier definition
  22. The rationals form a field statement
  23. Cartesian product definition
  24. Subset definition
  25. Uniqueness quantifier definition
  26. The rationals form an ordered field statement
  27. Binary relation definition
  28. Universal set definition
  29. Power set definition
  30. Order on the reals definition
  31. Complement definition
  32. Function definition
  33. Interval definition
  34. Sigma-algebra definition
  35. Preimage of a set definition
  36. Event definition
  37. Borel sigma-algebra definition
  38. Probability axioms concept
  39. Probability measure definition
  40. Probability space definition
  41. Random variable definition
  42. Stochastic process concept
  43. Kriging definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Kriging
About this page
TagAAQAF5GGES
URIm2://AAQAF5GGES
Kinddefinition
WritingW0 stub
MSC62M30, 62M20, 62H11
DefinesKriging
UsesVariogram, Stochastic process, Expected value, Mean squared error

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.