Line 16: Line 16:
 
# [[Recurrent State and Transient State]]
 
# [[Recurrent State and Transient State]]
  
−
[[References]]
+
[[Markov Chain References and Additional Readings]]
  
  
 
[[Category:MA271Fall2020Walther]]
 
[[Category:MA271Fall2020Walther]]

Revision as of 00:39, 6 December 2020

Markov Chains

Yi Li and Nicholas Fang

Table of Contents

Introduction and Historic Background

Basics of a Markov Chain

  1. Transition Diagrams
  2. Transition Probability Matrix
  3. n-th Term Transition
  4. Python Demonstration

Classification of States

  1. Communication and Reducibility
  2. Periodicity of Markov Chains
  3. Recurrent State and Transient State

Markov Chain References and Additional Readings

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Walther_MA271_Fall2020_topic2&oldid=78279"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett