Compound Markov counting processes and their applications to modeling infinitesimally over-dispersed systems
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 Lévy-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.
|Date of creation:||Jul 2011|
|Contact details of provider:|| Web page: http://portal.uc3m.es/portal/page/portal/dpto_estadistica|
When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws111914. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ana Poveda)
If references are entirely missing, you can add them using this form.