Advertisement
Published in:
2017 | OriginalPaper | Chapter
9. Static Replication
Author : Youssef Elouerkhaoui
Published in: Credit Correlation
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In principle, the direct (pricing) method requires, for each time step, \(2^{n+1}\) values, corresponding to the set of all possible default combinations; as the size of the underlying basket increases, the number of default configurations explodes exponentially. This significant limitation restricts the applicability of the method to baskets under 10 or 11 credits. As an alternative, we develop a different approach, which is based on a static replication idea. In this chapter, we describe how this static FTD replication is done: first, we show the relationship between kth-to-default and \((k-1)\)th-to-default swaps; then, we apply this recursion step-by-step until we arrive at the complete FTD expansion.