Computational methods for default timing
Abstract/Contents
- Abstract
- In risk management and derivatives pricing applications, one frequently works with a reduced-form model of correlated name-by-name default timing. In these models, a name defaults with some conditional default rate, an intensity. We develop, analyze and test transform, Monte Carlo and importance sampling methods for computing a variety of default timing problems. Transform methods are shown to yield (semi-)analytical formulae for various quantities of interest. Existing Monte Carlo simulation methods for default timing problems are surveyed. We introduce a novel concept of a simulation measure to provide a systematic approach to the efficiency and error analysis of these methods. A new Monte Carlo simulation algorithm is then devised to remove a significant source of bias inherent in existing techniques. The setting of rare-event simulation, which falls outside the scope of transform and plain Monte Carlo methods, is also addressed. A new importance sampling estimator which is applicable to any default timing model is proposed. Technical conditions guaranteeing the asymptotic optimality of the resulting estimator are studied in depth. Numerical results illustrate the performance of the estimator in a setting of a complex, portfolio credit risk application.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2014 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Shkolnik, Alexander D |
|---|---|
| Associated with | Stanford University, Institute for Computational and Mathematical Engineering. |
| Primary advisor | Giesecke, Kay |
| Thesis advisor | Giesecke, Kay |
| Thesis advisor | Owen, Art B |
| Thesis advisor | Papanicolaou, George |
| Advisor | Owen, Art B |
| Advisor | Papanicolaou, George |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | Alexander D. Shkolnik. |
|---|---|
| Note | Submitted to the Institute for Computational and Mathematical Engineering. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2014. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2014 by Alexander Dmitri Shkolnik
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...