A discrete-time stochastic procedure using the Markov property.
A random procedure (Markov procedure) in which the possibilities of discrete says in a series count only regarding the properties associated with the instantly preceding state and/or next preceeding state, in addition to the road in which the preceding state was reached. It varies through the much more basic Markov procedure for the reason that the says of a Markov string tend to be discrete versus constant. Specific real processes, such as for instance diffusion of a molecule in a fluid, are modelled as a Markov chain. See also arbitrary walk.
a Markov procedure for which the parameter is discrete time values