2000 character limit reached
Filters and smoothers for self-exciting Markov modulated counting processes
Published 25 Nov 2013 in q-fin.CP, math.PR, q-fin.TR, and stat.OT | (1311.6257v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.