Skip to content
Markov chain

File:Markovkate_01.svg · Wikimedia Commons · See Wikimedia Commons

EntityQ176645· pop 51· linked from 763 articles

Markov chain

Sign in to save

Also known as Markov process, Markov chains

stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event

Research

24,661 papers

via PubMed

Wikidata facts

Image
Markovkate 01.svg
Show 1 more fact
Commons category
Markov chains
Sources (3)

via Wikidata · CC0

~40 min read

Article

A diagram representing a two-state Markov process. The numbers are the probability of changing from one state to another state.

In probability theory and statistics, a Markov chain or Markov process is a stochastic process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). Markov processes are named in honor of the Russian mathematician Andrey Markov.

Gallery (5)

Connections

Categories