随机模型的翻译The Markov chain can be considered as a regenerative

上下文为
Proof: Fix states l, s ∈ R. The Markov chain can be considered as a regenerative process with the epochs at which the process visits state s as regeneration epochs. Defining a cycle as the time elapsed between two successive visits to state s, it follows from the definition of the mean recurrence time μss that
E(length of one cycle) = μss.
证明：令参数l、s为实数R.马尔可夫链（或：Markov链、Markov树状结构图）可视为含若干节点（或：时点）的再生（式）过程；这些时点处,该过程将参数s定义为重构节点.所谓循环,即指相邻两次取访参数s的时间差（时间间隔）,（且）这一点源于（对）平均周期时间的定义,即：
E（单循环周长）=μss

供参