exercise:C23749dab7: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Write a program to simulate the outcomes of a Markov chain after <math>n</math> steps, given the initial starting state and the transition matrix <math>\mat{P}</math> as data (see Example). Keep this program for...") |
No edit summary |
||
| Line 5: | Line 5: | ||
\newcommand{\secstoprocess}{\all} | \newcommand{\secstoprocess}{\all} | ||
\newcommand{\NA}{{\rm NA}} | \newcommand{\NA}{{\rm NA}} | ||
\newcommand{\mathds}{\mathbb}</math></div> Write a program to simulate the outcomes of a Markov | \newcommand{\mathds}{\mathbb}</math></div> Write a program to simulate the outcomes of a Markov chain after <math>n</math> steps, given the initial starting state and the transition matrix <math>\mat{P}</math> as data (see [[guide:52e01d4de7#exam 11.1.10 |Example]]). Keep this program for use in later problems. | ||
chain after <math>n</math> steps, given the initial starting state and the transition | |||
matrix <math>\mat{P}</math> as data (see [[guide:52e01d4de7#exam 11.1.10 |Example]]). Keep this program | |||
for use in | |||
later problems. | |||
Latest revision as of 00:25, 15 June 2024
[math]
\newcommand{\NA}{{\rm NA}}
\newcommand{\mat}[1]{{\bf#1}}
\newcommand{\exref}[1]{\ref{##1}}
\newcommand{\secstoprocess}{\all}
\newcommand{\NA}{{\rm NA}}
\newcommand{\mathds}{\mathbb}[/math]
Write a program to simulate the outcomes of a Markov chain after [math]n[/math] steps, given the initial starting state and the transition matrix [math]\mat{P}[/math] as data (see Example). Keep this program for use in later problems.