Abstract
One approach to the computations for Markov chains, due to Meyer, is to break a problem down into corresponding computations for several related chains involving a smaller number of states. In this spirit, we focus on the mean first passage matrix associated with a random walk on a connected graph, and consider the problem of transforming the computation of that matrix into smaller tasks. We show that this is possible when there is a cutpoint in the graph and provide an explicit formula for the mean first passage matrix when this is the case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
