Continuous Spatial Data Analysis: Overview of Spatial Stochastic Processes, Study notes of Electrical and Electronics Engineering

An overview of spatial stochastic processes, which are collections of random variables representing meaningful values at every location in a region of interest. The parallel between spatial and temporal stochastic processes and introduces standard notation for studying infinite collections of random variables. It also covers the concepts of means, variances, and covariances of these random variables.

Typology: Study notes

Pre 2010

Uploaded on 03/28/2010

koofers-user-pa0
koofers-user-pa0 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
________________________________________________________________________
ESE 502 II.1-1 Tony E. Smith
CONTINUOUS SPATIAL DATA ANALYSIS
1. Overview of Spatial Stochastic Processes
The key difference between continuous spatial data and point patterns is that there is
now assumed to be a meaningful value, ()Ys, at every location, s, in the region of
interest. For example, ()Ys might be the temperature at s or the level of air pollution at
s. We shall consider a number of illustrative examples in the next section. But before
doing so, it is convenient to outline the basic analytical framework to be used throughout
this part of the NOTEBOOK.
If the region of interest is again denoted by
R
, and if the value, ()Ys, at each location,
sR is treated as a random variable, then the collection of random variables
(1.1.1) {(): }Ys s R
is designated as a spatial stochastic process on
R
(also called a random field on
R
). It
should be clear from the outset that such (uncountably) infinite collections of random
variables cannot be analyzed in any meaningful way without making a number of strong
assumptions. We shall make these assumptions explicit as we proceed.
Observe next that there is a clear parallel between spatial stochastic processes and
temporal stochastic processes,
(1.1.2) { ( ): }Yt t T
where the set, T, is some continuous (possibly unbounded) interval of time. In many
respects, the only substantive difference between (1.1) and (1.2) is the dimension of the
underlying domain. Hence it is not surprising that most of the assumptions and analytical
methods to be employed here have their roots in time series analysis. One key difference
that should be mentioned here is that time is naturally ordered (from “past” to “present”
to “future”) whereas physical space generally has no preferred directions. This will have
a number of important consequences that will be discussed as we proceed.
1.1 Standard Notation
The key to studying the infinite collections of random
variables such as (1.1) is of course to take finite samples
of ( )Ys values, and attempt to draw inferences on the
basis of this information. To do so, we shall employ the
following standard notation. For any given set of sample
locations, { : 1,.., }
i
si n R=⊂ (as in Figure 1.1), let the
random vector: Fig.1.1. Sample Locations
1
s
n
s
2
s
n
s
R
pf3

Partial preview of the text

Download Continuous Spatial Data Analysis: Overview of Spatial Stochastic Processes and more Study notes Electrical and Electronics Engineering in PDF only on Docsity!

________________________________________________________________________

ESE 502 II.1-1 Tony E. Smith

CONTINUOUS SPATIAL DATA ANALYSIS

1. Overview of Spatial Stochastic Processes

The key difference between continuous spatial data and point patterns is that there is now assumed to be a meaningful value, Y s ( ) , at every location, s , in the region of

interest. For example, Y s ( ) might be the temperature at s or the level of air pollution at

s. We shall consider a number of illustrative examples in the next section. But before doing so, it is convenient to outline the basic analytical framework to be used throughout this part of the NOTEBOOK.

If the region of interest is again denoted by R , and if the value, Y s ( ) , at each location,

sR is treated as a random variable, then the collection of random variables

(1.1.1) { ( ) : Y s sR }

is designated as a spatial stochastic process on R (also called a random field on R ). It should be clear from the outset that such (uncountably) infinite collections of random variables cannot be analyzed in any meaningful way without making a number of strong assumptions. We shall make these assumptions explicit as we proceed.

Observe next that there is a clear parallel between spatial stochastic processes and temporal stochastic processes ,

(1.1.2) { ( ) : Y t tT }

where the set, T , is some continuous (possibly unbounded) interval of time. In many respects, the only substantive difference between (1.1) and (1.2) is the dimension of the underlying domain. Hence it is not surprising that most of the assumptions and analytical methods to be employed here have their roots in time series analysis. One key difference that should be mentioned here is that time is naturally ordered (from “past” to “present” to “future”) whereas physical space generally has no preferred directions. This will have a number of important consequences that will be discussed as we proceed.

1.1 Standard Notation

The key to studying the infinite collections of random variables such as (1.1) is of course to take finite samples of Y s ( ) values, and attempt to draw inferences on the

basis of this information. To do so, we shall employ the following standard notation. For any given set of sample locations , { si : i = 1,.., } nR (as in Figure 1.1), let the

random vector : (^) Fig.1.1. Sample Locations

s 1

sn

s 2

sn (^) −

R

NOTEBOOK FOR SPATIAL DATA ANALYSIS Part I. Spatial Point Pattern Analysis


________________________________________________________________________

ESE 502 I.1-2 Tony E. Smith

( (^) n ) n

Y s Y Y Y s Y

= ⎢^ ⎥ = ⎜^ ⎟

⎢ ⎥ ⎜^ ⎟

represent the possible list of values that may be observed at these locations. Note that (following standard matrix conventions) we always take vectors to be column vectors unless otherwise stated. The second representation in (1.3) will usually be used when the specific locations of these samples are not relevant. Note also that it is often more convenient to write vectors in transpose form as Y = ( Y 1 ,.., Yn )′, thus yielding a more

compact in-line representation. Each possible realization ,

1 ( 1 ,.., (^) n ) : n

y y y y y

= ′= ⎜^ ⎟

of the random vector, Y , then denotes a possible set of specific observations (such as the temperatures at each location i = 1,.., n ).

Most of our analysis will focus on the means and variances of these random variables, as well as the covariances between them. Again, following standard notation we shall

usually denote the mean of each random variable, Y ( si ), by

(1.1.5) E Y s [ ( i ) ]= μ ( si ) = μ i , i =1,.., n

so that the corresponding mean vector for Y is given by

(1.1.6) E Y ( ) = [ E Y ( 1 ),.., E Y ( n )]′ = ( μ 1 ,.., μ n )′=μ

Similarly, the variance of random variable, Y ( si ), can be denoted in a number of

alternative ways as:

(1.1.7) var( Yi ) = E [( Yi − μ i ) ]^2 = σ 2 ( si )= σ i^2 =σ ii

The last representation facilitates comparison with the covariance of two random

variables, Y ( si )and Y (^) ( s (^) j ), as defined by

(1.1.8) cov[ Y s ( i ), Y s ( j )] = E [( Yi − μ i )( Y j − μ j )]=σ ij

The full matrix of variances and covariances for the components of Y is then designated as the covariance matrix for Y , and is written alternatively as