Abstract
This paper deals with two problems of asymptotic aggregation of an ergodic Markov chain. The first is concerned with the determination of an aggregated Markov chain, the asymptotic probabilities of which are just equal to conditional asymptotic probabilities defined on the original Markov chain. The second one relates to the determination of an aggregated chain, the asymptotic probabilities of which are equal to the asymptotic probabilities of the elements of a given state partition. Both problems are approached from a topological point of view and solutions are given in terms of signal-flow graph techniques. Comments about the main computational features of the method are also included.
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.
