Filters and smoothers for self-exciting Markov modulated counting processes
classification
💱 q-fin.CP
math.PRq-fin.TRstat.OT
keywords
filterchaincountinghiddenmarkovprocessself-excitinganalysing
read the original abstract
We consider a self-exciting counting process, the parameters of which depend on a hidden finite-state Markov chain. We derive the optimal filter and smoother for the hidden chain based on observation of the jump process. This filter is in closed form and is finite dimensional. We demonstrate the performance of this filter both with simulated data, and by analysing the `flash crash' of 6th May 2010 in this framework.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.