nLab Markov chain

Redirected from "Chern-Dold character maps".
Contents

Contents

Idea

A Markov chain (named for Andrey Markov) is a sequence of random variables taking values in the state space of the chain, with the property that the probability of moving to the next state depends only upon the current state. For the case of a finite state space this is just the statement that

Pr(X n+1=x|X 1=x 1,X 2=x 2,...,X n=x n)=Pr(X n+1=x|X n=x n). Pr(X_{n + 1} = x | X_1 = x_1, X_2 = x_2,..., X_n = x_n) = Pr(X_{n + 1} = x | X_n = x_n).

Definition

A Markov chain is a special case of a stochastic process in which the dynamical laws at each stage of the process are a Markov dynamic law (which is defined on the page stochastic process) and the states at every stage of the process are identical.

Literature

Wikipedia.

Baez and his students recently defined a generalization, open Markov chains:

category: probability

Last revised on November 5, 2025 at 05:07:42. See the history of this page for a list of all contributions to it.