Fast Simulation of Multifactor Portfolio Credit Risk

Paul Glasserman (), Wanmo Kang () and Perwez Shahabuddin
Additional contact information
Paul Glasserman: Graduate School of Business, Columbia University, New York, New York 10027
Wanmo Kang: Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology (KAIST), Daejeon 305-701, Republic of Korea
Perwez Shahabuddin: Formerly at Department of Industrial Engineering and Operations Research, Columbia University, New York

Operations Research, 2008, vol. 56, issue 5, 1200-1217

Abstract: This paper develops rare-event simulation methods for the estimation of portfolio credit risk---the risk of losses to a portfolio resulting from defaults of assets in the portfolio. Portfolio credit risk is measured through probabilities of large losses, which are typically due to defaults of many obligors (sources of credit risk) to which a portfolio is exposed. An essential element of a portfolio view of credit risk is a model of dependence between these sources of credit risk: large losses occur rarely and are most likely to result from systematic risk factors that affect multiple obligors. As a consequence, estimating portfolio credit risk poses a challenge both because of the rare-event property of large losses and the dependence between defaults. To address this problem, we develop an importance sampling technique within the widely used Gaussian copula model of dependence. We focus on difficulties arising in multifactor models---that is, models in which multiple factors may be common to multiple obligors, resulting in complex dependence between defaults. Our importance sampling procedure shifts the mean of the common factor to increase the frequency of large losses. In multifactor models, different combinations of factor outcomes and defaults can produce large losses, so our method combines multiple importance sampling distributions, each associated with a shift in the mean of common factors. We characterize “optimal” mean shifts. Finding these points is both a combinatorial problem and a convex optimization problem, so we address computational aspects of this step as well. We establish asymptotic optimality results for our method, showing that---unlike standard simulation---it remains efficient as the event of interest becomes rarer.

Keywords: simulation; efficiency; variance reduction; probability; large deviations; finance; credit risk; portfolio (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0558 (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:inm:oropre:v:56:y:2008:i:5:p:1200-1217

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().