AMS 309 Lecture 4: Absorbing Markov Chains and Random Walk ModelS
| Institution | MURANG'A UNIVERSITY |
| Course | AMS 309: STOCHASTIC... |
| Year | 1st Year |
| Semester | Unknown |
| Posted By | Liz Ochola |
| File Type | |
| Pages | 10 Pages |
| File Size | 463.66 KB |
| Views | 3250 |
| Downloads | 2 |
| Price: |
Buy Now
|
Description
An absorbing Markov Chain contains only absorbing and transient states. If the number of states is finite, a Markov process starting from any transient state will eventually end in one of the absorbing states. Suppose that there are s absorbing states and t transient states so that the transition matrix P is order (s + t).
Below is the document preview.
Mathematics Notes F1-4
Trending!
UPDATED MATHEMATICS FI-4 NOTES
662 Pages
3976 Views
0 Downloads
9.09 MB
HISTORY NOTES FORM 1-4
Trending!
UPDATED HISTORY NOTES FORM 1-4
528 Pages
2381 Views
2 Downloads
3.84 MB
BUSINESS STUDIES FORM 2
Trending!
UPDATED BUSINESS STUDIES FORM 2
188 Pages
3037 Views
1 Downloads
1.59 MB
BUSINESS STUDIES FORM 3 NOTES
Trending!
UPDATED BUSINESS STUDIES FORM3 NOTES
40 Pages
5289 Views
4 Downloads
694 KB
BUSINESS STUDIES FORM 4 NOTES
Trending!
UPDATED BUSINESS STUDIES FORM4 NOTES
66 Pages
3725 Views
0 Downloads
1.1 MB
BUSINESS STUDIES FORM 1-4 NOTES
Trending!
UPDATED BUSINESS STUDIES FORM1-3 NOTES
325 Pages
4218 Views
2 Downloads
3.28 MB
AGRICULTURE FORM 1 NOTES
Trending!
UPDATED AGRICULTURE FORM 1 NOTES
50 Pages
3746 Views
0 Downloads
1.3 MB