| Display title | Markov chain |
| Default sort key | Markov chain |
| Page length (in bytes) | 2,005 |
| Namespace ID | 0 |
| Page ID | 3460 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | Kristomun (talk | contribs) |
| Date of page creation | 11:18, 12 May 2022 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 18:46, 12 May 2022 |
| Total number of edits | 4 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | A Markov chain is a statistical process describing a (possibly infinite) sequence of steps where the probability of a state (event) occurring depends only on what event happened last time. Markov chains are usually represented as a probability matrix '"`UNIQ--postMath-00000001-QINU`"' where '"`UNIQ--postMath-00000002-QINU`"' denotes the probability that the next step will be in state j given that the current step is in state i. |
