06.06.2013 Views

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

122 1 Probability <strong>Theory</strong><br />

States, Times, Notation, and Basic Definitions<br />

The smallest set <strong>of</strong> measure 1 is called the state space <strong>of</strong> a stochastic process;<br />

that is, the range <strong>of</strong> X is called the state space. Any point in the state space<br />

is called a state.<br />

If the index set <strong>of</strong> a stochastic process is countable, we say the process<br />

is a discrete time stochastic process. We can index a discrete time process<br />

by 0, 1, 2, . . ., especially if there is a fixed starting point, although <strong>of</strong>ten<br />

. . ., −2, −1, 0, 1, 2, .. . is more appropriate.<br />

In many applications, however, the index <strong>of</strong> a stochastic process ranges<br />

over a continuous interval. In that case, we <strong>of</strong>ten use a slightly different notation<br />

for the index set. We <strong>of</strong>ten consider the index set to be the interval<br />

[0, T], which <strong>of</strong> course could be transformed into any finite closed interval. If<br />

the index set is a real interval we say the process is a continuous time stochastic<br />

process. For continuous time stochastic processes, we sometimes use the<br />

notation X(t), although we also use Xt. We will discuss continuous time processes<br />

in Section 1.6.2 below and consider a simple continuous time process<br />

in Example 1.32.<br />

A property that seems to occur <strong>of</strong>ten in applications and, when it does, affords<br />

considerable simplifications for analyses is the conditional independence<br />

<strong>of</strong> the future on the past given the present. This property, called the Markov<br />

property, can be made precise.<br />

Definition 1.50 (Markov property)<br />

Suppose in the sequence {Xt}, for any set t0 < t1 < · · · < tn < t and any x,<br />

we have<br />

Pr(Xt ≤ x | Xt0, Xt1, . . ., Xtn) = Pr(Xt ≤ x | Xtn). (1.258)<br />

Then {Xt} is said to be a Markov sequence or the sequence is said to be<br />

Markovian. The condition expressed in equation (1.258) is called the Markov<br />

property.<br />

Definition 1.51 (homogeneous process)<br />

If the marginal distribution <strong>of</strong> X(t) is independent <strong>of</strong> t, the process is said to<br />

be homogeneous.<br />

***fix Many concepts are more easily defined for discrete time processes,<br />

although most have analogs for continuous time processes.<br />

Definition 1.52 (stopping time)<br />

Given a discrete time stochastic process ***fix change to continuous time<br />

a random variable<br />

X : {0, 1, 2, . ..} × Ω ↦→ IR,<br />

T : Ω ↦→ {0, 1, 2, . . .} (1.259)<br />

is called a stopping time if the event {T = t} depends only on X0, . . ., Xt for<br />

n = 0, 1, 2, . ...<br />

<strong>Theory</strong> <strong>of</strong> <strong>Statistics</strong> c○2000–2013 James E. Gentle

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

Saved successfully!

Ooh no, something went wrong!