Compound Markov counting processes and their applications to modeling infinitesimally over-dispersed systems

Abstract

We propose an infinitesimal dispersion index for Markov counting processes. We show that, under standard moment existence conditions, a process is infinitesimally (over-) equi-dispersed if, and only if, it is simple (compound), i.e. it increases in jumps of one (or more) unit(s), even though infinitesimally equi-dispersed processes might be under-, equi- or over-dispersed using previously studied indices. Compound processes arise, for example, when introducing continuous-time white noise to the rates of simple processes resulting in Levy-driven SDEs. We construct multivariate infinitesimally over-dispersed compartment models and queuing networks, suitable for applications where moment constraints inherent to simple processes do not hold.

26 pages

References in corpus (3)

• Time series analysis via mechanistic models
• Iterated filtering
• Compound Markov counting processes and their applications to modeling infinitesimally over-dispersed systems

Cited by in corpus (10)

• Compound Markov counting processes and their applications to modeling infinitesimally over-dispersed systems
• Panel data analysis via mechanistic models
• Markov Genealogy Processes
• Iterated Block Particle Filter for High-dimensional Parameter Learning: Beating the Curse of Dimensionality
• Bagged filters for partially observed interacting systems
• Informing policy via dynamic models: Cholera in Haiti
• A linear noise approximation for stochastic epidemic models fit to partially observed incidence counts
• Trajectory composition of Poisson time changes and Markov counting systems
• Accelerate iterated filtering
• Systemic Infinitesimal Over-dispersion on Graphical Dynamic Models