Article | REF: AF612 V1

Markov chains

Author: Jean LACROIX

Publication date: October 10, 2008

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

1. Markov evolution

To explain the notion of discrete-time Markovian evolution, one of the basic concepts is that of the transition operator, giving the probability law of the state of a random system at time (n + 1), given its state at time (n). In the case of a countable state space, this notion is reduced to that of the transition matrix, which we begin by specifying.

1.1 Transition matrices

Let E be a countable set.

Let

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Markov evolution