24.02.2013 Views

RANDOM FIELDS AND THEIR GEOMETRY

RANDOM FIELDS AND THEIR GEOMETRY

RANDOM FIELDS AND THEIR GEOMETRY

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4 1. Random fields<br />

with mj = E{Xj} and a non-negative definite 4 d × d covariance matrix<br />

C, with elements cij = E{(Xi − mi)(Xj − mj)}, such that the probability<br />

density of X is given by<br />

(1.2.3)<br />

ϕ(x) =<br />

1<br />

(2π) d/2 1<br />

e− 2<br />

|C| 1/2 (x−m)C−1 (x−m) ′<br />

,<br />

where |C| = det C is the determinant 5 of C. Consistently with the onedimensional<br />

case, we write this as X ∼ N(m, C), or X ∼ Nd(m, C) if we<br />

need to emphasise the dimension.<br />

In view of (1.2.3) we have that Gaussian distributions are completely<br />

determined by their first and second order moments and that uncorrelated<br />

Gaussian variables are independent. Both of these facts will be of crucial<br />

importance later on.<br />

While the definitions are fresh, note for later use that it is relatively<br />

straightforward to check from (1.2.3) that the characteristic function of a<br />

multivariate Gaussian X is given by<br />

(1.2.4)<br />

φ(θ) = E{e i〈θ,X′ 〉 } = e i〈θ,m ′ 〉− 1<br />

2 θCθ′<br />

.<br />

where θ ∈ R d .<br />

One consequence of the simple structure of φ is the fact that if {Xn}n≥1<br />

is an L 2 convergent 6 sequence of Gaussian vectors, then the limit X must<br />

also be Gaussian. Furthermore, if Xn ∼ N(mn, Cn), then<br />

(1.2.5)<br />

|mn − m| 2 → 0, and �Cn − C� 2 → 0,<br />

as n → ∞, where m and C are the mean and covariance matrix of the<br />

limiting Gaussian. The norm on vectors is Euclidean and that on matrices<br />

any of the usual. The proofs involve only (1.2.4) and the continuity theorem<br />

for convergence of random variables.<br />

One immediate consequence of either (1.2.3) or (1.2.4) is that if A is any<br />

d × d matrix and X ∼ Nd(m, C), then<br />

(1.2.6)<br />

AX ∼ N(mA, A ′ CA).<br />

4 A d×d matrix C is called non-negative definite (or positive semi-definite) if xCx ′ ≥ 0<br />

for all x ∈ R d . A function C : T × T → R is called non-negative definite if the matrices<br />

(C(ti, tj)) n i,j=1 are non-negative definite for all 1 ≤ n < ∞ and all (t1, . . . , tn) ∈ T n .<br />

5 Just in case you have forgotten what was in the Preface, here is a one-time reminder:<br />

The notation | | denotes any of ‘absolute value’, ‘Euclidean norm’, ‘determinant’ or<br />

‘Lebesgue measure’, depending on the argument, in a natural fashion. The notation � �<br />

is used only for either the norm of complex numbers or for special norms, when it usually<br />

appears with a subscript.<br />

6 That is, there exists a random vector X such that E{|Xn − X| 2 } → 0 as n → ∞.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!