Markov chains

इस पर आधारित

42 अनिवार्य पूर्वापेक्षाएँ (बिल्कुल नीचे तक)

आप सीखेंगे

• Model processes with transition matrices and compute n-step transition probabilities.
• Classify states as recurrent or transient and find stationary distributions.
• Prove convergence to equilibrium for irreducible aperiodic finite chains.

परिभाषा

• A Markov chain is a sequence of random variables in which the conditional distribution of the next state, given the past, depends only on the current state.
• A probability distribution π (as a row vector) is stationary for transition matrix P if πP = π.
• A chain is irreducible if every state can be reached from every other state.

प्रमेय

• An irreducible Markov chain on a finite state space has a unique stationary distribution.
• If it is also aperiodic, the distribution at time n converges to the stationary distribution from any starting distribution.
• Pólya: simple random walk is recurrent on ℤ and ℤ² and transient on ℤ³.

आम भ्रांतियाँ

• Reading 'memoryless' as 'forgets everything'; it means the future depends on the past only through the present.

आगे ले जाता है

वैकल्पिक खोजें

• Mathematical biology Stochastic models of populations and of genetic drift, such as the Wright–Fisher model, are Markov chains.
• Random structures: walks, percolation and random geometry Simple random walk on ℤᵈ returns to its start with probability 1 in dimensions 1 and 2 but not in dimension 3 (Pólya).
• ← Probability

आगे पढ़ने के लिए

• J. R. Norris, Markov Chains (1997)