from Part II - Statistical Models
Published online by Cambridge University Press: 17 August 2023
In this chapter we develop a generalization of hidden Markov models valid for the evolution of a system in continuous time. That is, we describe how to model and analyze hidden Markov jump processes. In this context, we introduce the concept of uniformization to simulate continuous time trajectories and then use uniformization to develop a Monte Carlo strategy to sample trajectories from a posterior over trajectories. Having discussed how trajectories can be sampled from the posterior over all candidate trajectories, we then describe strategies for full posterior inference over trajectories and other model parameters. We end with strategies for trajectory marginalization and continuous time filtering.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.