Computes the expected number of steps to go from any of the transient states to any of the recurrent states. The Markov chain should have at least one transient state for this method to work
Value
A named vector with the expected number of steps to go from a transient state to any of the recurrent ones
References
C. M. Grinstead and J. L. Snell. Introduction to Probability. American Mathematical Soc., 2012.
See also
Other first passage and hitting:
absorptionProbabilities(),
committorAB(),
firstPassage(),
firstPassageMultiple(),
hittingProbabilities(),
meanFirstPassageTime(),
meanNumVisits(),
meanRecurrenceTime(),
noofVisitsDist()