Markov evolution
Markov chains
Article REF: AF612 V1
Markov evolution
Markov chains

Author : Jean LACROIX

Publication date: October 10, 2008 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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 E denote the set of applications of E in ...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details