Comments on: Some recent theory for autoregressive count time series
No abstract is available for this item.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 21 (2012)
Issue (Month): 3 (September)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.seio.es/
|Order Information:||Web: http://www.springer.com/statistics/journal/11749/PS2|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Heinen, Andreas, 2003.
"Modelling Time Series Count Data: An Autoregressive Conditional Poisson Model,"
8113, University Library of Munich, Germany.
- HEINEN, Andréas, 2003. "Modelling time series count data: an autoregressive conditional Poisson model," CORE Discussion Papers 2003062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jung, Robert C. & Kukuk, Martin & Liesenfeld, Roman, 2006. "Time series of count data: modeling, estimation and diagnostics," Computational Statistics & Data Analysis, Elsevier, vol. 51(4), pages 2350-2364, December. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:spr:testjl:v:21:y:2012:i:3:p:442-446. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.