Abstract
Let (X t ,Y t ) be a pure jump Markov process, where X t takes values in \bf R and Y t is a counting process. We compare the filter of this system and a filter of a suitably modified system. We compute an explicit bound for the distance in the so-called bounded Lipschitz metric between the two filters. Finally we show how to use this bound to construct a discrete space approximation of the filter.
Sign-in/Register to access full text options 
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.
