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

Michael Artis, Massimiliano Marcellino and Tommaso Proietti

Oxford Bulletin of Economics and Statistics, 2004, vol. 66, issue 4, 537-565

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.

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (83)

Downloads: (external link)
https://doi.org/10.1111/j.1468-0084.2004.00092.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:obuest:v:66:y:2004:i:4:p:537-565

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0305-9049

Access Statistics for this article

Oxford Bulletin of Economics and Statistics is currently edited by Christopher Adam, Anindya Banerjee, Christopher Bowdler, David Hendry, Adriaan Kalwij, John Knight and Jonathan Temple

More articles in Oxford Bulletin of Economics and Statistics from Department of Economics, University of Oxford Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().