Skip to main content icon/video/no-internet

If one follows the usual definition of a process as a chain of events and events being changes of the state of some entity, one can distinguish between processes whose events are deterministic changes of the state of an entity and those in which the state of an entity changes with a certain probability. These latter processes are called stochastic processes. Another distinction that can be made is between continuous and discrete processes: In continuous processes, the state of an entity changes smoothly; in discrete processes, it changes only at certain points of time, either equidistant or not. Moreover, the states that an entity can acquire can be continuous or discrete. Whether processes in the real world are deterministic or stochastic, continuous or discrete is not often clear; the distinction rather refers to the models of these processes and the way an observer observes them.

Processes Discrete in Time and State Space

The simplest model of a stochastic process is discrete in time and state space, that is, the state space is countable, events happen at equidistant points of time, and for each pair of subsequent states Xs = i and Xt = j, a certain probability pij(s,t) holds (Markov chain in the strict sense). It is defined by its matrix of transition probabilities:

M(s,t)=(p11(s,t)p1n(s,t)pij(s,t)pn1(s,t)pnn(s,t)),j=1npij=1.

The state of the process is described as a vector containing the probabilities of the entities being in each possible state such that for two times s < t the probabilities of finding the entity in any of its possible states is

(p1(t)pi(t)pn(t))=(p1(s)pi(s)pn(s))(p11(s,t)p1n(s,t)pij(s,t)pn1(s,t)pnn(s,t)).

Markov chains are called homogeneous if M(s, t) = M(s+u, t+u), that is, if M is always the same for ts = Δ. The standard case of a homogeneous Markov chain is the so-called random walk between cumulative gains and losses of a simple game tossing coins whereby head wins one unit and tail loses one unit. The states of this process are all positive and negative integer numbers with a transition matrix that contains only zeros in the main diagonal, q in the diagonal below the main diagonal, p in the diagonal above the main diagonal, and zeros elsewhere such that the cumulative gains and losses change only between neighboring states but can reach every positive and negative numbers (with a fair coin, p = q = 0.5 holds).

Stochastic Processes in Continuous Time and State Space

Random walk can be generalized to the so-called Brownian motion in continuous time and space: If the difference between neighboring states is called η, and the time span between subsequent observations Δ and the limit Δ → 0, η → 0 is taken one can show that the probability density function (PDF) of the current state of Brownian motion is the PDF of the normal distribution whose mean is the state at the beginning of the process and whose variance is proportional to the time elapsed since the process started. Moreover, the PDF of the state change in a constant time interval is the PDF of the normal distribution with mean zero and constant variance.

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading