Changes

Jump to navigation Jump to search

Markov chain (view source)

Revision as of 20:29, August 14, 2021

471 bytes added ,  20:29, August 14, 2021
improved
Line 1: Line 1: −
A '''Markov chain''', sometimes called a Markov process, is a sequence in which any state in the sequence depends only on the previous state, and is independent of all other states.  An example of a Markov process is the [[random walk problem]].
+
A '''Markov chain''', sometimes called a Markov process, is a sequence in which any state in the sequence depends only on the previous state, and is independent of all other states.  An example of a Markov process is the random walk problem.
 +
 
 +
A coin toss is a simple example of a common Markov chain.  The weather, viewed simplistically, is another example: the likelihood of whether it rains tomorrow does not depend on whether it rained last week.  Word prediction when typing on smart phones is another example.  In these processes the prior history is irrelevant to the next state.  Put another way, a Markov chain has no memory.
 +
 
 +
An entire field of [[mathematics]] developed based on the logic of Markov chains.
    
[[Category:Probability and Statistics]]
 
[[Category:Probability and Statistics]]
Aschlafly
Anthony, Irenaeus, Siteadmin, apieditor, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
126,565

edits

Retrieved from "https://www.conservapedia.com/Special:MobileDiff/1788131"

Navigation menu