Robust Filtering Algorithm for Markov Jump Processes with High-Frequency Counting Observations

2020 ◽  
Vol 81 (4) ◽  
pp. 575-588
Author(s):  
A. V. Borisov
2013 ◽  
Vol 150 (1) ◽  
pp. 181-203 ◽  
Author(s):  
Paolo Muratore-Ginanneschi ◽  
Carlos Mejía-Monasterio ◽  
Luca Peliti

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 506
Author(s):  
Andrey Borisov ◽  
Igor Sokolov

The paper is devoted to the optimal state filtering of the finite-state Markov jump processes, given indirect continuous-time observations corrupted by Wiener noise. The crucial feature is that the observation noise intensity is a function of the estimated state, which breaks forthright filtering approaches based on the passage to the innovation process and Girsanov’s measure change. We propose an equivalent observation transform, which allows usage of the classical nonlinear filtering framework. We obtain the optimal estimate as a solution to the discrete–continuous stochastic differential system with both continuous and counting processes on the right-hand side. For effective computer realization, we present a new class of numerical algorithms based on the exact solution to the optimal filtering given the time-discretized observation. The proposed estimate approximations are stable, i.e., have non-negative components and satisfy the normalization condition. We prove the assertions characterizing the approximation accuracy depending on the observation system parameters, time discretization step, the maximal number of allowed state transitions, and the applied scheme of numerical integration.


Sign in / Sign up

Export Citation Format

Share Document