exercise:E90c32bbb5: 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> Prove that, in an <math>r</math>-state ergodic chain, it is possible to go from any state to any other state in at most <math>r - 1</math> steps.") |
No edit summary |
||
| Line 1: | Line 1: | ||
Prove that, in an <math>r</math>-state ergodic chain, it is possible to go from any state to any other state in at most <math>r - 1</math> steps. | |||
possible to go from any state to any other state in at most <math>r - 1</math> steps. | |||
Latest revision as of 23:03, 17 June 2024
Prove that, in an [math]r[/math]-state ergodic chain, it is possible to go from any state to any other state in at most [math]r - 1[/math] steps.