Advanced Search
MyIDEAS: Login

Dating Business Cycles: A Methodological Contribution with an Application to the Euro Area

Contents:

Author Info

  • Michael Artis
  • Massimiliano Marcellino
  • Tommaso Proietti

Abstract

This paper proposes a dating algorithm based on an appropriately defined Markov chain that enforces alternation of peaks and troughs, and duration constraints concerning the phases and the full cycle. The algorithm, which implements Harding and Pagan's non-parametric dating methodology, allows an assessment of the uncertainty of the estimated turning points caused by filtering and can be used to construct indices of business cycle diffusion, aiming at assessing how widespread are cyclical movements throughout the economy. Its adaptation to the notion of a deviation cycle and the imposition of depth constraints are also discussed. We illustrate the algorithm with reference to the issue of dating the euro-area business cycle and analysing its characteristics, both from the classical and the growth cycle perspectives. Copyright 2004 Blackwell Publishing Ltd.

Download Info

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.
File URL: http://www.blackwell-synergy.com/servlet/useragent?func=synergy&synergyAction=showTOC&journalCode=obes&volume=66&issue=4&year=2004&part=null
File Function: link to full text
Download Restriction: Access to full text is restricted to subscribers.

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.

Bibliographic Info

Article provided by Department of Economics, University of Oxford in its journal Oxford Bulletin of Economics and Statistics.

Volume (Year): 66 (2004)
Issue (Month): 4 (09)
Pages: 537-565

as in new window
Handle: RePEc:bla:obuest:v:66:y:2004:i:4:p:537-565

Contact details of provider:
Postal: Manor Rd. Building, Oxford, OX1 3UQ
Email:
Web page: http://www.blackwellpublishing.com/journal.asp?ref=0305-9049
More information through EDIRC

Order Information:
Web: http://www.blackwellpublishing.com/subs.asp?ref=0305-9049

Related research

Keywords:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bla:obuest:v:66:y:2004:i:4:p:537-565. 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: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.