Computing arbitrage-free yields in multi-factor Gaussian shadow-rate term structure models

Marcel A. Priebsch
Additional contact information
Marcel A. Priebsch: https://www.federalreserve.gov/econres/marcel-a-priebsch.htm

No 2013-63, Finance and Economics Discussion Series from Board of Governors of the Federal Reserve System (U.S.)

Abstract: This paper develops a method to approximate arbitrage-free bond yields within a term structure model in which the short rate follows a Gaussian process censored at zero (a \"shadow-rate model\" as proposed by Black, 1995). The censoring ensures that model-implied yields are constrained to be positive, but it also introduces non-linearity that renders standard bond pricing formulas inapplicable. In particular, yields are not linear functions of the underlying state vector as they are in affine term structure models (see Piazzesi, 2010). Existing approaches towards computing yields in shadow-rate models suffer from high computational burden or low accuracy. In contrast, I show that the technique proposed in this paper is sufficiently fast for single-step estimation of a three-factor shadow-rate term structure model, and sufficiently accurate to evaluate yields to within approximately half a basis point.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.federalreserve.gov/pubs/feds/2013/201363/201363abs.html (text/html)
http://www.federalreserve.gov/pubs/feds/2013/201363/201363pap.pdf (application/pdf)

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:fip:fedgfe:2013-63

Access Statistics for this paper

More papers in Finance and Economics Discussion Series from Board of Governors of the Federal Reserve System (U.S.) Contact information at EDIRC.
Bibliographic data for series maintained by Ryan Wolfslayer ; Keisha Fournillier ().