Abstract
For a general multidimensional denumerable state Markov process with any initial state probability vector, the probability density function and its LS transform of the first passage time to a certain given state set are obtained and the algorithms for them are derived. It is proved that the resulting errors of the algorithms are both uniform in their respective arguments. Some numerical results are presented.
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.
