2005
DOI: 10.1109/tac.2005.852565
|View full text |Cite
|
Sign up to set email alerts
|

General smoothing formulas for Markov-modulated Poisson observations

Abstract: Abstract-In this paper, we compute general smoothing dynamics for partially observed dynamical systems generating Poisson observations. We consider two model classes, each Markov modulated Poisson processes, whose stochastic intensities depend upon the state of an unobserved Markov process. In one model class, the hidden state process is a continuously-valued Itô process, which gives rise to a continuous sample-path stochastic intensity. In the other model class, the hidden state process is a continuous-time M… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(24 citation statements)
references
References 29 publications
0
24
0
Order By: Relevance
“…Now, let us move to the filtering equation for X . We follow the arguments of derivation given in Elliott and Malcolm (2005), Cohen and Elliott (2013). Firstly, we want to derive the unnormalized filter of X :…”
Section: Remarkmentioning
confidence: 99%
“…Now, let us move to the filtering equation for X . We follow the arguments of derivation given in Elliott and Malcolm (2005), Cohen and Elliott (2013). Firstly, we want to derive the unnormalized filter of X :…”
Section: Remarkmentioning
confidence: 99%
“…If one allows (λ A , λ D ) to depend explicitly on (κ, e, g), based on some empirical analysis for example, one can use the information of V (t, w) to achieve desirable intensities of investment flows. 7 The optimal hedging for an insurance portfolio…”
Section: )mentioning
confidence: 99%
“…There exist state smoothers for MMPP such as those given by Elliott and Malcolm (2005). Much the same as in the context of discrete-time hidden Markov models, a computationally efficient algorithm, fixed point smoothing algorithm, is available to estimate the probability of the underlying Markov chain in a given state at a specific time conditioned on all available observations, which only involves the forward and backward probabilities (see MacDonald and Zucchini (1997, pp …”
Section: Statistical Inference On the State Process And Observed Poinmentioning
confidence: 99%