{"categories":["Credit"],"contentHtml":"<h3>Copulas</h3><p>This is going to be a basic introduction, this is a complex topic to cover comprehensively.</p><h3>Limitations of Multi-Name Latent Variables</h3><p>The Gaussian latent-variable framework and conditional-independence construction are developed in O’Kane’s Chapter 13 (pp. 241–258). Its one-factor version is useful for simulating default times and calibrating thresholds to single-name hazard rates, but one common factor constrains how the names can move together.</p><p>The Multi-Name latent variable model is single factor. There is one variable which is seen by the other credits. They each have their own idiosyncratic component. In terms of properties, simulations, that’s it. We looked at conditional hazard rate and calculation of the portfolio of loss. Last assignment is related to this particular topic.</p><p>We can model the correlation, we can simulate, we can calibrate, the time-dependent threshold, based on the hazard rate and survival probabilities.</p><p>How can we extend this model?</p><p>There’s <strong>limitations on the one-factor correlation structure</strong>.</p><p>In one-factor, we have a number of correlation parameters <math><msub><mi>𝑁</mi><mi>𝑐</mi></msub></math>. Recall that the correlation between two credits <math><mi>𝑖</mi></math> and <math><mi>𝑗</mi></math> is <math><msub><mi>𝛽</mi><mrow><mi>𝑖</mi><mi>𝑗</mi></mrow></msub></math>. We have the constraint that the absolute value of each correlation parameter is less than or equal to <math><mn>1</mn></math>.</p><p>The entire correlation matrix has <math><mfrac><mrow><msub><mi>𝑁</mi><mi>𝑐</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑁</mi><mi>𝑐</mi></msub><mo lspace=\"0em\" rspace=\"0em\">−</mo><mn>1</mn><mo stretchy=\"false\">)</mo></mrow><mn>2</mn></mfrac></math> correlation parameters, which is a lot.</p><p>The question we can ask: Does one factor structure prevent the modeling of groups, or <strong>sectors</strong>? The model may be insufficient.</p><p>We can look at some examples. Consider a simple portfolio of <math><mn>4</mn></math> credits grouped in two sectors. How can we represent such groups? We could take <math><msub><mi>𝛽</mi><mn>1</mn></msub><mo>=</mo><msub><mi>𝛽</mi><mn>2</mn></msub><mo>=</mo><msub><mi>𝛽</mi><mi>𝑎</mi></msub></math>. These two stocks will have the same exposure to the market variable <math><mi>𝑧</mi></math>, and vice versa for the other sector <math><msub><mi>𝛽</mi><mn>3</mn></msub><mo>=</mo><msub><mi>𝛽</mi><mn>4</mn></msub><mo>=</mo><msub><mi>𝛽</mi><mi>𝑏</mi></msub></math>.</p><p>In a single factor model, the correlation is the product of two correlation parameters for two credits.</p><math display=\"block\"><mi>𝐶</mi><mo>=</mo><mrow><mo>[</mo><mtable><mtr><mtd><mn>1</mn></mtd><mtd><msubsup><mi>𝛽</mi><mi>𝑎</mi><mn>2</mn></msubsup></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mspace width=\"0.2222em\"></mspace><msubsup><mi>𝛽</mi><mi>𝑎</mi><mn>2</mn></msubsup></mtd><mtd><mn>1</mn></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mspace width=\"0.2222em\"></mspace><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mn>1</mn></mtd><mtd><msubsup><mi>𝛽</mi><mi>𝑏</mi><mn>2</mn></msubsup><mspace width=\"0.2222em\"></mspace><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub></mtd><mtd><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub></mtd><mtd><msubsup><mi>𝛽</mi><mi>𝑏</mi><mn>2</mn></msubsup></mtd><mtd><mn>1</mn></mtd></mtr></mtable><mo>]</mo></mrow></math><p>If you split this into four square matrices, then you’ll see the sub-correlation matrix for each group. The correlation between the two groups.</p><p>Let’s assume that beta_a &gt; beta_b &gt; 0. One is more exposed to the market than the other. This also implies that</p><math display=\"block\"><mi>𝑐</mi><mo>=</mo><msubsup><mi>𝛽</mi><mi>𝑎</mi><mn>2</mn></msubsup><mo>≥</mo><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mo>≥</mo><msubsup><mi>𝛽</mi><mi>𝑏</mi><mn>2</mn></msubsup></math><p>For example, take <math><msub><mi>𝛽</mi><mi>𝑎</mi></msub><mo>=</mo><mn>0.8</mn></math> and <math><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mo>=</mo><mn>0.5</mn></math>. The within-sector correlations are <math><msubsup><mi>𝛽</mi><mi>𝑎</mi><mn>2</mn></msubsup><mo>=</mo><mn>64</mn><mi>%</mi></math> in sector A and <math><msubsup><mi>𝛽</mi><mi>𝑏</mi><mn>2</mn></msubsup><mo>=</mo><mn>25</mn><mi>%</mi></math> in sector B. The cross-sector correlation is <math><msub><mi>𝛽</mi><mi>𝑎</mi></msub><msub><mi>𝛽</mi><mi>𝑏</mi></msub><mo>=</mo><mn>40</mn><mi>%</mi></math>. Sector B is therefore more correlated with sector A than it is with itself. That is the one-factor limitation: every correlation must be the product of two loadings on the same market factor.</p><p>Sector B is not fully captured.</p><p>So we can try to extend the model, make it more complex, and accommodate this particular scenario.</p><p>In this case, we can consider a <strong>two-factor</strong> version of the model.</p><p>For some credit i, we have</p><math display=\"block\"><msub><mi>𝐴</mi><mi>𝑖</mi></msub><mo>=</mo><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑖</mi></mrow></msub><msub><mi>𝑍</mi><mn>1</mn></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑖</mi></mrow></msub><msub><mi>𝑍</mi><mn>2</mn></msub><mo>+</mo><msqrt><mn>1</mn><mo>−</mo><msubsup><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑖</mi></mrow><mn>2</mn></msubsup><mo>−</mo><msubsup><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑖</mi></mrow><mn>2</mn></msubsup></msqrt><msub><mi>𝜖</mi><mi>𝑖</mi></msub></math><math display=\"block\"><msub><mi>𝐴</mi><mi>𝑗</mi></msub><mo>=</mo><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑗</mi></mrow></msub><msub><mi>𝑍</mi><mn>1</mn></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑗</mi></mrow></msub><msub><mi>𝑍</mi><mn>2</mn></msub><mo>+</mo><msqrt><mn>1</mn><mo>−</mo><msubsup><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑗</mi></mrow><mn>2</mn></msubsup><mo>−</mo><msubsup><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑗</mi></mrow><mn>2</mn></msubsup></msqrt><msub><mi>𝜖</mi><mi>𝑗</mi></msub></math><p>Similar to the previous formulation, but with one more factor.</p><p>The linear combination of standard normal is standard normal, so that doesn’t change.</p><p>The latent variable A_j corresponds still to the time-dependent threshold for each credit.</p><p>We can calculate the correlation between these assets in a similar kind of matrix. For each element:</p><math display=\"block\"><msub><mi>𝑐</mi><mrow><mi>𝑖</mi><mi>𝑗</mi></mrow></msub><mo>=</mo><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑖</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑗</mi></mrow></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑖</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑗</mi></mrow></msub></math><p>We can revisit the matrix in the following case.</p><p>In sector A, the credits have a first factor weight and second factor weight beta_1a and beta_2a.</p><p>Sector B is similar with beta_1b and beta_2b</p><p>This is more generic, you would say this group has correlation to these factors.</p><p>We’ll assume the first credits are from sector A.</p><p>That would be the correlation between credit a in sector a and b in sector b</p><math display=\"block\"><mi>𝑐</mi><mo>=</mo><mrow><mo>[</mo><mtable><mtr><mtd><mn>1</mn></mtd><mtd><msubsup><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow><mn>2</mn></msubsup><mo>+</mo><msubsup><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow><mn>2</mn></msubsup></mtd><mtd><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑏</mi></mrow></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑏</mi></mrow></msub></mtd><mtd><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑏</mi></mrow></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑏</mi></mrow></msub><mspace width=\"0.2222em\"></mspace><msubsup><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow><mn>2</mn></msubsup><mo>+</mo><msubsup><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow><mn>2</mn></msubsup></mtd><mtd><mn>1</mn></mtd><mtd><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑏</mi></mrow></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑏</mi></mrow></msub></mtd><mtd><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑏</mi></mrow></msub><mo>+</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow></msub><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑏</mi></mrow></msub></mtd></mtr></mtable><mo>]</mo></mrow></math><p>(Bottom half is same as top half, mirrored)</p><p>For example, give sector A loadings <math><mrow><mo>(</mo><mrow><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑎</mi></mrow></msub><mo>,</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑎</mi></mrow></msub></mrow><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mrow><mn>0.8</mn><mo>,</mo><mn>0</mn></mrow><mo>)</mo></mrow></math> and sector B loadings <math><mrow><mo>(</mo><mrow><msub><mi>𝛽</mi><mrow><mn>1</mn><mi>𝑏</mi></mrow></msub><mo>,</mo><msub><mi>𝛽</mi><mrow><mn>2</mn><mi>𝑏</mi></mrow></msub></mrow><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mrow><mn>0</mn><mo>,</mo><mn>0.5</mn></mrow><mo>)</mo></mrow></math>. The within-sector correlations are then 64% for A and 25% for B, while the cross-sector correlation is the dot product <math><mn>0.8</mn><mo lspace=\"0.2222222222222222em\" rspace=\"0.2222222222222222em\">⋅</mo><mn>0</mn><mo>+</mo><mn>0</mn><mo lspace=\"0.2222222222222222em\" rspace=\"0.2222222222222222em\">⋅</mo><mn>0.5</mn><mo>=</mo><mn>0</mn></math>. Separate factors can represent strong dependence within each group and weaker dependence across groups. More generally, the correlation between two credits is the dot product of their factor-loading vectors.</p><p>In general, M-factors are needed to model M-sector portfolio. Three sectors? Three factors.</p><p>The simulation is very simple, but instead of generating just a Z_1, we generate Z_1 and Z_2. It becomes a little more complex, with the number of parameters, compared to a single factor. We go from n(n-1)/2, to a lot more. If you want to implement these, you need to calibrate the exposure to the parameters. So the complexity becomes prohibitive, and that’s a limitation.</p><p>It has some applicability, but in general, the more typical way is through copula functions.</p><h3>Copulas (Finally)</h3><p>You can model default time dependencies, correlations for default times. We also will have measures of dependency. We will look at main copulas for credit modeling, and Monte Carlo pricing of correlated products with copulas.</p><p>We’ll look at some properties, and dependency limits, and some relations between copulas and the model we just discussed. And other ways of modeling dependence than correlation. If we have time, we’ll have some code to visualize copulas.</p><p>Next week, I have a section for estimation of parameters of copulas, more complex. But for the final exam, copulas will not be included.</p><p>The latent variable model can also be expressed as a Gaussian copula, so they are related.</p><p><strong>Definition: An N-dimensional copula function C is a multivariate cumulative distribution function with N uniform marginals with probabilities u_1, u_2, … u_N.</strong></p><p>This is just the multivariate cdf. One of the characteristics is that it has uniform marginals. So we can say that thIS IS THE JOINT PROBABILITY</p><math display=\"block\"><mi>ℙ</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mover accent=\"true\"><msub><mi>𝑈</mi><mn>1</mn></msub><mo>̂</mo></mover><mo>≤</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mover accent=\"true\"><msub><mi>𝑈</mi><mn>2</mn></msub><mo>̂</mo></mover><mo>≤</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><mover accent=\"true\"><msub><mi>𝑈</mi><mi>𝑁</mi></msub><mo>̂</mo></mover><mo>≤</mo><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo stretchy=\"false\">)</mo></math><p>This is the definition of such copulas where</p><math display=\"block\"><mover accent=\"true\"><msub><mi>𝑈</mi><mi>𝑖</mi></msub><mo>̂</mo></mover><mo>∼</mo><mtext> Uniform</mtext><mo form=\"prefix\" stretchy=\"false\">(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo stretchy=\"false\">)</mo></math><h3>Dependent Structure of Default Times of N Credits</h3><p>Let <math><msub><mi>𝑞</mi><mrow><mi>𝑖</mi><mrow><mo>(</mo><mi>𝑡</mi><mo>)</mo></mrow></mrow></msub><mo>=</mo><mi>𝑃</mi><mrow><mo>(</mo><mrow><msub><mi>𝜏</mi><mi>𝑖</mi></msub><mo>≤</mo><mi>𝑡</mi></mrow><mo>)</mo></mrow></math> be credit <math><mi>𝑖</mi></math>’s cumulative default probability by time <math><mi>𝑡</mi></math>. The default-time copula is</p><p><math><mi>𝐶</mi><mrow><mo>(</mo><mrow><msub><mi>𝑞</mi><mn>1</mn></msub><mrow><mo>(</mo><msub><mi>𝑡</mi><mn>1</mn></msub><mo>)</mo></mrow><mo>,</mo><msub><mi>𝑞</mi><mn>2</mn></msub><mrow><mo>(</mo><msub><mi>𝑡</mi><mn>2</mn></msub><mo>)</mo></mrow><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝑞</mi><mrow><mi>𝑁</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑁</mi></msub><mo>)</mo></mrow></mrow></msub></mrow><mo>)</mo></mrow><mo>=</mo><mi>𝑃</mi><mrow><mo>(</mo><mrow><msub><mi>𝜏</mi><mn>1</mn></msub><mo>≤</mo><msub><mi>𝑡</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝜏</mi><mn>2</mn></msub><mo>≤</mo><msub><mi>𝑡</mi><mn>2</mn></msub><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝜏</mi><mi>𝑁</mi></msub><mo>≤</mo><msub><mi>𝑡</mi><mi>𝑁</mi></msub></mrow><mo>)</mo></mrow></math>.</p><p>It expresses the joint probability of defaults by their marginal default probabilities. A copula is a multivariate distribution with uniform marginals; it separates the choice of each name’s marginal default curve from the choice of dependence across names. For continuous marginal distributions, Sklar’s theorem gives a unique copula representation:</p><p><math><mi>𝐻</mi><mrow><mo>(</mo><mrow><msub><mi>𝑥</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝑥</mi><mi>𝑁</mi></msub></mrow><mo>)</mo></mrow><mo>=</mo><mi>𝐶</mi><mrow><mo>(</mo><mrow><msub><mi>𝐹</mi><mn>1</mn></msub><mrow><mo>(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo>)</mo></mrow><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝐹</mi><mrow><mi>𝑁</mi><mrow><mo>(</mo><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo>)</mo></mrow></mrow></msub></mrow><mo>)</mo></mrow></math>.</p><p>Setting all but one input to one recovers that name’s marginal, for example <math><mi>𝐶</mi><mrow><mo>(</mo><mrow><mn>1</mn><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝑢</mi><mi>𝑘</mi></msub><mo>,</mo><mi>…</mi><mo>,</mo><mn>1</mn></mrow><mo>)</mo></mrow><mo>=</mo><msub><mi>𝑢</mi><mi>𝑘</mi></msub></math>. If any default probability is zero, the joint-default probability is zero. The same construction works in <math><mi>𝑁</mi></math> dimensions; the bivariate case is a convenient way to display it.</p><p>For the Gaussian latent-variable model, the bivariate default probability is</p><p><math><mi>𝑃</mi><mrow><mo>(</mo><mrow><msub><mi>𝜏</mi><mi>𝑖</mi></msub><mo>≤</mo><msub><mi>𝑡</mi><mi>𝑖</mi></msub><mo>,</mo><msub><mi>𝜏</mi><mi>𝑗</mi></msub><mo>≤</mo><msub><mi>𝑡</mi><mi>𝑗</mi></msub></mrow><mo>)</mo></mrow><mo>=</mo><msub><mi mathvariant=\"normal\">Φ</mi><mn>2</mn></msub><mrow><mo>(</mo><mrow><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msub><mi>𝑞</mi><mrow><mi>𝑖</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑖</mi></msub><mo>)</mo></mrow></mrow></msub><mo>)</mo></mrow><mo>,</mo><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msub><mi>𝑞</mi><mrow><mi>𝑗</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑗</mi></msub><mo>)</mo></mrow></mrow></msub><mo>)</mo></mrow><mo>;</mo><msub><mi>𝜌</mi><mrow><mi>𝑖</mi><mo rspace=\"0em\">,</mo><mi>𝑗</mi></mrow></msub></mrow><mo>)</mo></mrow></math>.</p><p>Equivalently, its Gaussian copula is <math><msubsup><mi>𝐶</mi><mi>𝜌</mi><mrow><mi>𝐺</mi><mi>𝐶</mi></mrow></msubsup><mrow><mo>(</mo><mrow><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi></mrow><mo>)</mo></mrow><mo>=</mo><msub><mi mathvariant=\"normal\">Φ</mi><mn>2</mn></msub><mrow><mo>(</mo><mrow><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow><mo>,</mo><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><mi>𝑣</mi><mo>)</mo></mrow><mo>;</mo><mi>𝜌</mi></mrow><mo>)</mo></mrow></math>. This is the expression that was missing from the original note at this point (O’Kane, Chapter 14, pp. 261–263).</p><h3>Dependency Limits</h3><p>Latent variable model has <strong>dependence limits</strong>. We kind of look to see when we have positive and negative dependence of names in the portfolio. This is not equal to the correlations, but we can think a little bit in that way.</p><p>When we have an expression for a copula, (the joint probability distribution), it’s good to look at these properties to see the maximum and minimum dependence, and then how to measure them, based on differences dependency metrics.</p><h3>Independence</h3><p>The simplest is independence.</p><p>The expression for such an independence copula is</p><math display=\"block\"><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><msub><mi>𝑢</mi><mn>1</mn></msub><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo>=</mo><munderover><mo form=\"prefix\" lspace=\"0em\">∏</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑁</mi></munderover><msub><mi>𝑢</mi><mi>𝑖</mi></msub></math><p>If they’re independent, the joint probability distribution is the product of the marginals.</p><h3>Perfect Positive Dependence</h3><h3>Perfect Negative Dependence</h3><p>We can then state the <strong>Fréchet-Hoeffding Theorem:</strong></p><p>For any copula <math><mi>𝐶</mi><mo lspace=\"0.2777777777777778em\" rspace=\"0.2777777777777778em\">:</mo><msup><mrow><mo>[</mo><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow><mo>]</mo></mrow><mi>𝑁</mi></msup><mo stretchy=\"false\">→</mo><mrow><mo>[</mo><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow><mo>]</mo></mrow></math></p><p>and any realization <math><mrow><mo>(</mo><mrow><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub></mrow><mo>)</mo></mrow><mo>∈</mo><msup><mrow><mo>[</mo><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow><mo>]</mo></mrow><mi>𝑁</mi></msup></math>, the following bounds hold:</p><math display=\"block\"><mi>𝑤</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><mi>𝑀</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo stretchy=\"false\">)</mo></math><p>Basically this theorem says if you have a copula with a particular realization, this copula is bounded above and below by two functions M and w.</p><p>w the lower Fréchet-Hoeffding bound is</p><math display=\"block\"><mi>𝑤</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><mn>1</mn><mo>−</mo><mi>𝑁</mi><mo>+</mo><munderover><mo form=\"prefix\" lspace=\"0em\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑁</mi></munderover><msub><mi>𝑢</mi><mi>𝑖</mi></msub><msub><mo stretchy=\"false\">)</mo><mo>+</mo></msub></math><p>and upper bound is</p><math display=\"block\"><mi>𝑀</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mo form=\"prefix\" lspace=\"0em\" rspace=\"0em\">min</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo stretchy=\"false\">)</mo></math><p>In the bivariate case where we only have two variables u and v, we have</p><math display=\"block\"><mo lspace=\"0em\" rspace=\"0em\">max</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>+</mo><mi>𝑣</mi><mo>−</mo><mn>1</mn><mo>,</mo><mn>0</mn><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><mo form=\"prefix\" lspace=\"0em\" rspace=\"0em\">min</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi><mo stretchy=\"false\">)</mo></math><p>Upper bound is perfect positive, lower bound is perfect negative.</p><p>This result holds for <strong>any copula</strong>.</p><p>Ideally we would like to estimate this copula with some data. We need to make a choice for this expression, and estimate those parameters.</p><p>But the question is, this is a representation of the original joint probability distribution, but is this a unique representation? Can we have different copulas for this?</p><p>We have one more theorem, <strong>Sklar’s Theorem</strong>.</p><p>We know by definition, the copula is a multivariate distribution function.</p><p>Any such function can be written as a copula, and its representation is unique, the marginal distributions are continuous. If you have discrete distributions, then uniqueness is not guaranteed.</p><p>Let’s consider more generally, any N-dimensional distribution function H with marginal distributions F_1, F_2, F_N for random variables x_1, x_2, … x_N. H is the joint probability distribution.</p><p>Because this is multi-dimensional, this will correspond to</p><math display=\"block\"><mi>𝐻</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mo>,</mo><mi>…</mi><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mi>ℙ</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mn>1</mn></msub><mo>≤</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑋</mi><mn>2</mn></msub><mo>≤</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mi>…</mi><mo>,</mo><msub><mi>𝑋</mi><mi>𝑁</mi></msub><mo>≤</mo><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo stretchy=\"false\">)</mo></math><p>We can write this as the probability that the marginal function F_1</p><math display=\"block\"><mo form=\"infix\" lspace=\"0em\">=</mo><mi>ℙ</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝐹</mi><mn>1</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mn>1</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><msub><mi>𝐹</mi><mn>1</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>,</mo><msub><mi>𝐹</mi><mn>2</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><msub><mi>𝐹</mi><mn>2</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>,</mo><mi>…</mi><msub><mi>𝐹</mi><mi>𝑁</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>≤</mo><msub><mi>𝐹</mi><mi>𝑁</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math><p>We basically want to transform this to get a copula function, to get here from a generic N-dimensional function.</p><p>Let <math><mover accent=\"true\"><msub><mi>𝑈</mi><mi>𝑖</mi></msub><mo>̂</mo></mover><mo>=</mo><msub><mi>𝐹</mi><mi>𝑖</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mi>𝑖</mi></msub><mo stretchy=\"false\">)</mo></math> and the realization <math><msub><mi>𝑢</mi><mi>𝑖</mi></msub><mo>=</mo><msub><mi>𝐹</mi><mi>𝑖</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mi>𝑖</mi></msub><mo stretchy=\"false\">)</mo></math> The marginal will take values between 0 and 1, it’s a cdf.</p><p>The original function</p><math display=\"block\"><mi>𝐻</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mi>ℙ</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mover accent=\"true\"><msub><mi>𝑈</mi><mn>1</mn></msub><mo>̂</mo></mover><mo>≤</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><mover accent=\"true\"><msub><mi>𝑈</mi><mi>𝑁</mi></msub><mo>̂</mo></mover><mo>≤</mo><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo stretchy=\"false\">)</mo></math><math display=\"block\"><mi>𝐻</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑥</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝐹</mi><mn>1</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>1</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>,</mo><msub><mi>𝐹</mi><mn>2</mn></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mi>…</mi><msub><mi>𝐹</mi><mi>𝑁</mi></msub><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mi>𝑛</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math><p>We know that C is a unique copula if these Fs are continuous.</p><p>And in reverse,</p><math display=\"block\"><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo>,</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mi>…</mi><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>=</mo><mi>𝐻</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msubsup><mi>𝐹</mi><mn>1</mn><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>1</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>,</mo><msubsup><mi>𝐹</mi><mn>2</mn><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>,</mo><mi>…</mi><msubsup><mi>𝐹</mi><mi>𝑁</mi><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑢</mi><mi>𝑁</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></math><p>The relationship between these two is that the copula is going to separate the choice of the marginals from the choice of the dependency structures. It decouples these things. We can take any function and its copula representation, and calibrate it to the names of the portfolio independent of the dependency structure based on the way I want to assign dependency to this portfolio.</p><p>We might want to add some dynamics to this dependencies, the difference between credit default so we can calculate the conditional survival/default probability. We could impose this by choosing a different dependency structure.</p><h3>Alternative to Dependence Structure of Default Times</h3><p>The survival copula uses survival probabilities <math><msub><mi>𝑠</mi><mrow><mi>𝑖</mi><mrow><mo>(</mo><mi>𝑡</mi><mo>)</mo></mrow></mrow></msub><mo>=</mo><mn>1</mn><mo>−</mo><msub><mi>𝑞</mi><mrow><mi>𝑖</mi><mrow><mo>(</mo><mi>𝑡</mi><mo>)</mo></mrow></mrow></msub></math>:</p><p><math><mover accent=\"true\"><mi>𝐶</mi><mo>̂</mo></mover><mrow><mo>(</mo><mrow><msub><mi>𝑠</mi><mn>1</mn></msub><mrow><mo>(</mo><msub><mi>𝑡</mi><mn>1</mn></msub><mo>)</mo></mrow><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝑠</mi><mrow><mi>𝑁</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑁</mi></msub><mo>)</mo></mrow></mrow></msub></mrow><mo>)</mo></mrow><mo>=</mo><mi>𝑃</mi><mrow><mo>(</mo><mrow><msub><mi>𝜏</mi><mn>1</mn></msub><mo>&gt;</mo><msub><mi>𝑡</mi><mn>1</mn></msub><mo>,</mo><mi>…</mi><mo>,</mo><msub><mi>𝜏</mi><mi>𝑁</mi></msub><mo>&gt;</mo><msub><mi>𝑡</mi><mi>𝑁</mi></msub></mrow><mo>)</mo></mrow></math>.</p><p>In the bivariate case, the default and survival copulas are related by</p><p><math><mover accent=\"true\"><mi>𝐶</mi><mo>̂</mo></mover><mrow><mo>(</mo><mrow><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi></mrow><mo>)</mo></mrow><mo>=</mo><mi>𝑢</mi><mo>+</mo><mi>𝑣</mi><mo>−</mo><mn>1</mn><mo>+</mo><mi>𝐶</mi><mrow><mo>(</mo><mrow><mn>1</mn><mo>−</mo><mi>𝑢</mi><mo>,</mo><mn>1</mn><mo>−</mo><mi>𝑣</mi></mrow><mo>)</mo></mrow></math>.</p><p>For the Gaussian latent-variable model, default thresholds are jointly normal. The probability that both thresholds have been crossed is</p><p><math><mi>𝑃</mi><mrow><mo>(</mo><mrow><msub><mi>𝜏</mi><mi>𝑖</mi></msub><mo>≤</mo><msub><mi>𝑡</mi><mi>𝑖</mi></msub><mo>,</mo><msub><mi>𝜏</mi><mi>𝑗</mi></msub><mo>≤</mo><msub><mi>𝑡</mi><mi>𝑗</mi></msub></mrow><mo>)</mo></mrow><mo>=</mo><msub><mi mathvariant=\"normal\">Φ</mi><mn>2</mn></msub><mrow><mo>(</mo><mrow><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msub><mi>𝑞</mi><mrow><mi>𝑖</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑖</mi></msub><mo>)</mo></mrow></mrow></msub><mo>)</mo></mrow><mo>,</mo><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><msub><mi>𝑞</mi><mrow><mi>𝑗</mi><mrow><mo>(</mo><msub><mi>𝑡</mi><mi>𝑗</mi></msub><mo>)</mo></mrow></mrow></msub><mo>)</mo></mrow><mo>;</mo><msub><mi>𝜌</mi><mrow><mi>𝑖</mi><mo rspace=\"0em\">,</mo><mi>𝑗</mi></mrow></msub></mrow><mo>)</mo></mrow></math>.</p><p>Thus the Gaussian copula is</p><p><math><msubsup><mi>𝐶</mi><mi>𝜌</mi><mrow><mi>𝐺</mi><mi>𝐶</mi></mrow></msubsup><mrow><mo>(</mo><mrow><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi></mrow><mo>)</mo></mrow><mo>=</mo><msub><mi mathvariant=\"normal\">Φ</mi><mn>2</mn></msub><mrow><mo>(</mo><mrow><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow><mo>,</mo><msup><mi mathvariant=\"normal\">Φ</mi><mrow><mo>−</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><mi>𝑣</mi><mo>)</mo></mrow><mo>;</mo><mi>𝜌</mi></mrow><mo>)</mo></mrow></math>.</p><p>The standard bivariate normal is unchanged when both variables are multiplied by <math><mo>−</mo><mn>1</mn></math>. As a result, the Gaussian default and survival copulas have the same form. For a non-degenerate Gaussian copula, extreme joint events become less likely relative to their marginal tails as the thresholds move farther out: its upper- and lower-tail dependence coefficients are zero (O’Kane, Chapter 14, pp. 261–263, 269–270).</p><h3>Measuring Dependence</h3><p>An important property of this is dependence, so the question is how do you measure?</p><p>There are many ways.</p><p>The most popular way is <strong>Pearson Linear Correlation</strong>.</p><math display=\"block\"><msub><mi>𝜌</mi><mi>𝑃</mi></msub><mo>=</mo><mfrac><mrow><mi>𝔼</mi><mrow><mo>[</mo><mrow><mi>𝑋</mi><mi>𝑌</mi></mrow><mo>]</mo></mrow><mo>−</mo><mi>𝔼</mi><mrow><mo>[</mo><mi>𝑋</mi><mo>]</mo></mrow><mi>𝔼</mi><mrow><mo>[</mo><mi>𝑌</mi><mo>]</mo></mrow></mrow><mrow><msqrt><mi>𝔼</mi><mrow><mo>[</mo><msup><mi>𝑋</mi><mn>2</mn></msup><mo>]</mo></mrow><mo>−</mo><mi>𝔼</mi><msup><mrow><mo>[</mo><mi>𝑋</mi><mo>]</mo></mrow><mn>2</mn></msup></msqrt><msqrt><mi>𝔼</mi><mrow><mo>[</mo><msup><mi>𝑌</mi><mn>2</mn></msup><mo>]</mo></mrow><mo>−</mo><mi>𝔼</mi><msup><mrow><mo>[</mo><mi>𝑌</mi><mo>]</mo></mrow><mn>2</mn></msup></msqrt></mrow></mfrac></math><p>Advantages: easier to understand. Everyone understands correlation. It is also invariant under linear transformation. Say we change the variables by scaling and shifting (multiplying and adding), it doesn’t affect the correlation.</p><p>For jointly Gaussian variables, zero correlation does imply independence.</p><p>However, there is a big disadvantage: linear correlation being 0 DOES NOT imply independence in general</p><p>Sometimes the correlation is abused. It is a measure of linear dependence between variables. But just because there’s no linear dependence, doesn’t mean there are other kinds of dependence.</p><p>Here is a five-point counterexample. Let <math><mi>𝑋</mi></math> take the equally likely values <math><mo>−</mo><mn>2</mn><mo>,</mo><mo form=\"prefix\">−</mo><mn>1</mn><mo>,</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn></math>, and set <math><mi>𝑌</mi><mo>=</mo><msup><mi>𝑋</mi><mn>2</mn></msup></math>. Then <math><mi>𝐸</mi><mrow><mo>[</mo><mi>𝑋</mi><mo>]</mo></mrow><mo>=</mo><mn>0</mn></math>, <math><mi>𝐸</mi><mrow><mo>[</mo><mi>𝑌</mi><mo>]</mo></mrow><mo>=</mo><mn>2</mn></math>, and <math><mi>𝐸</mi><mrow><mo>[</mo><mrow><mi>𝑋</mi><mi>𝑌</mi></mrow><mo>]</mo></mrow><mo>=</mo><mi>𝐸</mi><mrow><mo>[</mo><msup><mi>𝑋</mi><mn>3</mn></msup><mo>]</mo></mrow><mo>=</mo><mn>0</mn></math>, so</p><p><math><mtext>Cov</mtext><mrow><mo>(</mo><mrow><mi>𝑋</mi><mo>,</mo><mi>𝑌</mi></mrow><mo>)</mo></mrow><mo>=</mo><mi>𝐸</mi><mrow><mo>[</mo><mrow><mi>𝑋</mi><mi>𝑌</mi></mrow><mo>]</mo></mrow><mo>−</mo><mi>𝐸</mi><mrow><mo>[</mo><mi>𝑋</mi><mo>]</mo></mrow><mi>𝐸</mi><mrow><mo>[</mo><mi>𝑌</mi><mo>]</mo></mrow><mo>=</mo><mn>0</mn></math>.</p><p>Yet <math><mi>𝑌</mi></math> is completely determined by <math><mi>𝑋</mi></math>. The variables are dependent, but their linear correlation is zero. This illustrates why Pearson correlation alone does not describe general dependence (O’Kane, Chapter 14, §14.3, pp. 264–265).</p><h3><strong>Rank Correlation</strong></h3><p>Given <math><mi>𝑛</mi></math> observations <math><mrow><mo>(</mo><mrow><msub><mi>𝑋</mi><mi>𝑖</mi></msub><mo>,</mo><msub><mi>𝑌</mi><mi>𝑖</mi></msub></mrow><mo>)</mo></mrow></math>, let <math><msub><mi>𝑅</mi><mi>𝑖</mi></msub></math> and <math><msub><mi>𝑆</mi><mi>𝑖</mi></msub></math> be the ranks of <math><msub><mi>𝑋</mi><mi>𝑖</mi></msub></math> and <math><msub><mi>𝑌</mi><mi>𝑖</mi></msub></math>. A pair of observations is concordant when their order agrees:</p><p><math><mo stretchy=\"false\">(</mo><msub><mi>𝑋</mi><mn>1</mn></msub><mo>−</mo><msub><mi>𝑋</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑌</mi><mn>1</mn></msub><mo>−</mo><msub><mi>𝑌</mi><mn>2</mn></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>&gt;</mo><mn>0</mn></math>.</p><p>It is discordant when the product is negative. Rank measures compare these orderings, so a monotone transformation of either variable does not change them.</p><p>For example, if five observations have identical ranks in both variables, then all <math><mrow><mo>(</mo><mfrac linethickness=\"0\"><mn>5</mn><mn>2</mn></mfrac><mo>)</mo></mrow><mo>=</mo><mn>10</mn></math> pairs are concordant and none are discordant. Kendall’s tau and Spearman’s rho are both <math><mn>1</mn></math>. This spells out the perfectly ordered example in the notes (O’Kane, Chapter 14, §14.4, pp. 265–268).</p><h4>Kendall’s Tau</h4><math display=\"block\"><mi>𝜏</mi><mo>=</mo><mfrac><mrow><mi>𝑐</mi><mo>−</mo><mi>𝑑</mi></mrow><mrow><mi>𝑐</mi><mo>+</mo><mi>𝑑</mi></mrow></mfrac></math><p>where c is the number of concordant pairs, and d is the number of discordant pairs.</p><p>Then the total number of pairs is c + d, which n choose 2 = n(n-1)/2.</p><p>In the previous case, all of these are concordant, so this is 1/1.</p><p>And if it’s discordant, that’s −1.</p><p>The sample estimator of Kendall’s τ is</p><math display=\"block\"><mi>𝜏</mi><mo>=</mo><mfrac><mrow><mn>2</mn><msubsup><mo form=\"prefix\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mrow><mi>𝑛</mi><mo lspace=\"0em\" rspace=\"0em\">−</mo><mn>1</mn></mrow></msubsup><msubsup><mo form=\"prefix\" lspace=\"0em\">∑</mo><mrow><mi>𝑗</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">+</mo><mn>1</mn></mrow><mi>𝑛</mi></msubsup><mtext>sign</mtext><mo form=\"prefix\" stretchy=\"false\">(</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑥</mi><mi>𝑖</mi></msub><mo>−</mo><msub><mi>𝑥</mi><mi>𝑗</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑦</mi><mi>𝑖</mi></msub><mo>−</mo><msub><mi>𝑦</mi><mi>𝑗</mi></msub><mo form=\"postfix\" stretchy=\"false\">)</mo><mo stretchy=\"false\">)</mo></mrow><mrow><mi>𝑛</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑛</mi><mo>−</mo><mn>1</mn><mo stretchy=\"false\">)</mo></mrow></mfrac></math><p>So basically you’re enumerating all these pairs, and then dividing it by the known bottom, and flipping the 2.</p><p>For continuous variables, independence gives <math><mi>𝜏</mi><mo>=</mo><mn>0</mn></math>, perfect positive dependence gives <math><mi>𝜏</mi><mo>=</mo><mn>1</mn></math>, and perfect negative dependence gives <math><mi>𝜏</mi><mo>=</mo><mo form=\"prefix\">−</mo><mn>1</mn></math>.</p><p>For a continuous x, y, Kendall’s tau should be</p><math display=\"block\"><msub><mi>𝜏</mi><mrow><mi>𝑥</mi><mi>𝑦</mi></mrow></msub><mo>=</mo><mn>4</mn><msubsup><mo form=\"prefix\">∫</mo><mn>0</mn><mn>1</mn></msubsup><msubsup><mo form=\"prefix\" lspace=\"0em\">∫</mo><mn>0</mn><mn>1</mn></msubsup><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi><mo form=\"postfix\" stretchy=\"false\">)</mo><mi>𝑑</mi><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi><mo form=\"postfix\" stretchy=\"false\">)</mo><mo>−</mo><mn>1</mn></math><h4>Spearman’s Rho</h4><p>Spearman’s rho is Pearson correlation applied to the ranks. With no ties, it can be calculated directly from the rank differences:</p><math display=\"block\"><msub><mi>𝜌</mi><mi>𝑆</mi></msub><mo>=</mo><mfrac><mrow><msubsup><mo lspace=\"0em\" rspace=\"0em\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑛</mi></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑅</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑅</mi><mo>̄</mo></mover><mo form=\"postfix\" stretchy=\"false\">)</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑆</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑆</mi><mo>̄</mo></mover><mo stretchy=\"false\">)</mo></mrow><mrow><msqrt><msubsup><mo lspace=\"0em\" rspace=\"0em\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑛</mi></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑅</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑅</mi><mo>̄</mo></mover><msup><mo stretchy=\"false\">)</mo><mn>2</mn></msup></msqrt><msqrt><msubsup><mo lspace=\"0em\" rspace=\"0em\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑛</mi></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑆</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑆</mi><mo>̄</mo></mover><msup><mo stretchy=\"false\">)</mo><mn>2</mn></msup></msqrt></mrow></mfrac><mo>=</mo><mfrac><mrow><mn>12</mn><msubsup><mo form=\"prefix\" rspace=\"0em\">∑</mo><mrow><mi>𝑖</mi><mo lspace=\"0em\" rspace=\"0em\">=</mo><mn>1</mn></mrow><mi>𝑛</mi></msubsup><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑅</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑅</mi><mo>̄</mo></mover><mo form=\"postfix\" stretchy=\"false\">)</mo><mo form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>𝑆</mi><mi>𝑖</mi></msub><mo>−</mo><mover accent=\"true\"><mi>𝑆</mi><mo>̄</mo></mover><mo stretchy=\"false\">)</mo></mrow><mrow><mi>𝑛</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><msup><mi>𝑛</mi><mn>2</mn></msup><mo>−</mo><mn>1</mn><mo stretchy=\"false\">)</mo></mrow></mfrac></math><p>Furthermore, for a continuous x and y.</p><math display=\"block\"><msub><mi>𝜌</mi><mi>𝑆</mi></msub><mo>=</mo><mn>12</mn><msubsup><mo form=\"prefix\">∫</mo><mn>0</mn><mn>1</mn></msubsup><msubsup><mo form=\"prefix\" lspace=\"0em\">∫</mo><mn>0</mn><mn>1</mn></msubsup><mi>𝐶</mi><mo form=\"prefix\" stretchy=\"false\">(</mo><mi>𝑢</mi><mo>,</mo><mi>𝑣</mi><mo form=\"postfix\" stretchy=\"false\">)</mo><mi>𝑑</mi><mi>𝑢</mi><mi>𝑑</mi><mi>𝑣</mi><mo>−</mo><mn>3</mn></math><p>This is important because for each copula it’s going to be dependent, as a function of those parameters, it’s going to have different values in the Pearson, Kendall or Spearman value.</p><p>There are some advantages to rank correlation, which is that it’s able to capture nonlinear dependence, but it has some disadvantage as well.</p><h3>Tail Dependence</h3><p>Rank correlation records whether observations tend to move in the same or opposite order, but it does not measure the magnitude of extreme co-movements. Tail dependence asks whether one variable remains extreme when the other is already in an extreme tail.</p><p>For variables with marginal CDFs <math><msub><mi>𝐹</mi><mi>𝑋</mi></msub></math> and <math><msub><mi>𝐹</mi><mi>𝑌</mi></msub></math>, the upper-tail dependence coefficient is</p><p><math><msub><mi>𝜆</mi><mi>𝑈</mi></msub><mo>=</mo><msub><mo form=\"prefix\" lspace=\"0em\" rspace=\"0.16666666666666666em\">lim</mo><mrow><mi>𝑢</mi><mo lspace=\"0em\" rspace=\"0em\" stretchy=\"false\">→</mo><mn>1</mn></mrow></msub><mi>𝑃</mi><mrow><mo>(</mo><mrow><mi>𝑌</mi><mo>&gt;</mo><msubsup><mi>𝐹</mi><mi>𝑌</mi><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow><mspace width=\"0.2222em\"></mspace><mo lspace=\"0em\" rspace=\"0em\">|</mo><mspace width=\"0.2222em\"></mspace><mi>𝑋</mi><mo>&gt;</mo><msubsup><mi>𝐹</mi><mi>𝑋</mi><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></math>.</p><p>The lower-tail coefficient is</p><p><math><msub><mi>𝜆</mi><mi>𝐿</mi></msub><mo>=</mo><msub><mo form=\"prefix\" lspace=\"0em\" rspace=\"0.16666666666666666em\">lim</mo><mrow><mi>𝑢</mi><mo lspace=\"0em\" rspace=\"0em\" stretchy=\"false\">→</mo><mn>0</mn></mrow></msub><mi>𝑃</mi><mrow><mo>(</mo><mrow><mi>𝑌</mi><mo>≤</mo><msubsup><mi>𝐹</mi><mi>𝑌</mi><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow><mspace width=\"0.2222em\"></mspace><mo lspace=\"0em\" rspace=\"0em\">|</mo><mspace width=\"0.2222em\"></mspace><mi>𝑋</mi><mo>≤</mo><msubsup><mi>𝐹</mi><mi>𝑋</mi><mrow><mo>−</mo><mn>1</mn></mrow></msubsup><mrow><mo>(</mo><mi>𝑢</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></math>.</p><p>Here <math><mi>𝑢</mi></math> is a quantile level. In credit-risk terms, joint defaults correspond to the lower tail of latent asset values, while large portfolio losses correspond to the upper tail of losses. A positive coefficient means that an extreme observation in one variable has a non-vanishing limiting probability of being accompanied by an extreme observation in the other. The tail plot in the notes is illustrating this limiting behavior.</p><p>The Gaussian copula has zero upper- and lower-tail dependence for correlations strictly between <math><mo>−</mo><mn>1</mn></math> and <math><mn>1</mn></math>. It can match ordinary dependence while understating the chance of joint extremes; a copula with tail dependence is needed when that behavior matters (O’Kane, Chapter 14, §§14.5–14.6, pp. 269–270).</p>","contentSourceFormat":"typst","contentTypst":"== Copulas\n<copulas>\nThis is going to be a basic introduction, this is a complex topic to cover comprehensively.\n\n== Limitations of Multi-Name Latent Variables\n<limitations-of-multi-name-latent-variables>\nThe Gaussian latent-variable framework and conditional-independence construction are developed in O’Kane's Chapter 13 (pp. 241–258). Its one-factor version is useful for simulating default times and calibrating thresholds to single-name hazard rates, but one common factor constrains how the names can move together.\n\nThe Multi-Name latent variable model is single factor. There is one variable which is seen by the other credits. They each have their own idiosyncratic component. In terms of properties, simulations, that's it. We looked at conditional hazard rate and calculation of the portfolio of loss. Last assignment is related to this particular topic.\n\nWe can model the correlation, we can simulate, we can calibrate, the time-dependent threshold, based on the hazard rate and survival probabilities.\n\nHow can we extend this model?\n\nThere's #strong[limitations on the one-factor correlation structure].\n\nIn one-factor, we have a number of correlation parameters $N_c$. Recall that the correlation between two credits $i$ and $j$ is $beta_(i j)$. We have the constraint that the absolute value of each correlation parameter is less than or equal to $1$.\n\nThe entire correlation matrix has $frac(N_c\\(N_c - 1\\), 2)$ correlation parameters, which is a lot.\n\nThe question we can ask: Does one factor structure prevent the modeling of groups, or #strong[sectors]? The model may be insufficient.\n\nWe can look at some examples. Consider a simple portfolio of $4$ credits grouped in two sectors. How can we represent such groups? We could take $beta_1 = beta_2 = beta_a$. These two stocks will have the same exposure to the market variable $z$, and vice versa for the other sector $beta_3 = beta_4 = beta_b$.\n\nIn a single factor model, the correlation is the product of two correlation parameters for two credits.\n\n$ C = mat(delim: \"[\", 1, beta_a^2, beta_a beta_b, beta_a beta_b med beta_a^2, 1, beta_a beta_b, beta_a beta_b med beta_a beta_b, beta_a beta_b 1, beta_b^2 med beta_a beta_b, beta_a beta_b, beta_b^2, 1) $\n\nIf you split this into four square matrices, then you'll see the sub-correlation matrix for each group. The correlation between the two groups.\n\nLet's assume that beta\\_a \\> beta\\_b \\> 0. One is more exposed to the market than the other. This also implies that\n\n$ c = beta_a^2 gt.eq beta_a beta_b gt.eq beta_b^2 $\n\nFor example, take $beta_a=0.8$ and $beta_b=0.5$. The within-sector correlations are $beta_a^2=64%$ in sector A and $beta_b^2=25%$ in sector B. The cross-sector correlation is $beta_a beta_b=40%$. Sector B is therefore more correlated with sector A than it is with itself. That is the one-factor limitation: every correlation must be the product of two loadings on the same market factor.\n\nSector B is not fully captured.\n\nSo we can try to extend the model, make it more complex, and accommodate this particular scenario.\n\nIn this case, we can consider a #strong[two-factor] version of the model.\n\nFor some credit i, we have\n\n$ A_i = beta_(1 i) Z_1 + beta_(2 i) Z_2 + sqrt(1 - beta_(1 i)^2 - beta_(2 i)^2) epsilon.alt_i $\n\n$ A_j = beta_(1 j) Z_1 + beta_(2 j) Z_2 + sqrt(1 - beta_(1 j)^2 - beta_(2 j)^2) epsilon.alt_j $\n\nSimilar to the previous formulation, but with one more factor.\n\nThe linear combination of standard normal is standard normal, so that doesn't change.\n\nThe latent variable A\\_j corresponds still to the time-dependent threshold for each credit.\n\nWe can calculate the correlation between these assets in a similar kind of matrix. For each element:\n\n$ c_(i j) = beta_(1 i) beta_(1 j) + beta_(2 i) beta_(2 j) $\n\nWe can revisit the matrix in the following case.\n\nIn sector A, the credits have a first factor weight and second factor weight beta\\_1a and beta\\_2a.\n\nSector B is similar with beta\\_1b and beta\\_2b\n\nThis is more generic, you would say this group has correlation to these factors.\n\nWe'll assume the first credits are from sector A.\n\nThat would be the correlation between credit a in sector a and b in sector b\n\n$ c = mat(delim: \"[\", 1, beta_(1 a)^2 + beta_(2 a)^2, beta_(1 a) beta_(1 b) + beta_(2 a) beta_(2 b), beta_(1 a) beta_(1 b) + beta_(2 a) beta_(2 b) med beta_(1 a)^2 + beta_(2 a)^2, 1, beta_(1 a) beta_(1 b) + beta_(2 a) beta_(2 b), beta_(1 a) beta_(1 b) + beta_(2 a) beta_(2 b)) $\n\n\\(Bottom half is same as top half, mirrored)\n\nFor example, give sector A loadings $(beta_(1a), beta_(2a))=(0.8,0)$ and sector B loadings $(beta_(1b), beta_(2b))=(0,0.5)$. The within-sector correlations are then 64% for A and 25% for B, while the cross-sector correlation is the dot product $0.8 dot 0 + 0 dot 0.5=0$. Separate factors can represent strong dependence within each group and weaker dependence across groups. More generally, the correlation between two credits is the dot product of their factor-loading vectors.\n\nIn general, M-factors are needed to model M-sector portfolio. Three sectors? Three factors.\n\nThe simulation is very simple, but instead of generating just a Z\\_1, we generate Z\\_1 and Z\\_2. It becomes a little more complex, with the number of parameters, compared to a single factor. We go from n(n-1)/2, to a lot more. If you want to implement these, you need to calibrate the exposure to the parameters. So the complexity becomes prohibitive, and that's a limitation.\n\nIt has some applicability, but in general, the more typical way is through copula functions.\n\n== Copulas (Finally)\n<copulas-finally>\nYou can model default time dependencies, correlations for default times. We also will have measures of dependency. We will look at main copulas for credit modeling, and Monte Carlo pricing of correlated products with copulas.\n\nWe'll look at some properties, and dependency limits, and some relations between copulas and the model we just discussed. And other ways of modeling dependence than correlation. If we have time, we'll have some code to visualize copulas.\n\nNext week, I have a section for estimation of parameters of copulas, more complex. But for the final exam, copulas will not be included.\n\nThe latent variable model can also be expressed as a Gaussian copula, so they are related.\n\n#strong[Definition: An N-dimensional copula function C is a multivariate cumulative distribution function with N uniform marginals with probabilities u\\_1, u\\_2, … u\\_N.]\n\nThis is just the multivariate cdf. One of the characteristics is that it has uniform marginals. So we can say that thIS IS THE JOINT PROBABILITY\n\n$ bb(P)\\(hat(U_1) lt.eq u_1\\,hat(U_2) lt.eq u_2 dots.h hat(U_N) lt.eq u_N\\)= C\\(u_1\\,u_2 dots.h u_N\\) $\n\nThis is the definition of such copulas where\n\n$ hat(U_i) tilde.op upright(\" Uniform\")\\(0\\,1\\) $\n\n== Dependent Structure of Default Times of N Credits\n<dependent-structure-of-default-times-of-n-credits>\nLet $q_i(t)=P(tau_i<=t)$ be credit $i$'s cumulative default probability by time $t$. The default-time copula is\n\n$C(q_1(t_1), q_2(t_2), dots.h, q_N(t_N))=P(tau_1<=t_1, tau_2<=t_2, dots.h, tau_N<=t_N)$.\n\nIt expresses the joint probability of defaults by their marginal default probabilities. A copula is a multivariate distribution with uniform marginals; it separates the choice of each name's marginal default curve from the choice of dependence across names. For continuous marginal distributions, Sklar's theorem gives a unique copula representation:\n\n$H(x_1, dots.h, x_N)=C(F_1(x_1), dots.h, F_N(x_N))$.\n\nSetting all but one input to one recovers that name's marginal, for example $C(1, dots.h, u_k, dots.h, 1)=u_k$. If any default probability is zero, the joint-default probability is zero. The same construction works in $N$ dimensions; the bivariate case is a convenient way to display it.\n\nFor the Gaussian latent-variable model, the bivariate default probability is\n\n$P(tau_i<=t_i, tau_j<=t_j)=Phi_2(Phi^(-1)(q_i(t_i)), Phi^(-1)(q_j(t_j)); rho_(i,j))$.\n\nEquivalently, its Gaussian copula is $C_(rho)^(G C)(u,v)=Phi_2(Phi^(-1)(u), Phi^(-1)(v); rho)$. This is the expression that was missing from the original note at this point (O’Kane, Chapter 14, pp. 261–263).\n\n== Dependency Limits\n<dependency-limits>\nLatent variable model has #strong[dependence limits]. We kind of look to see when we have positive and negative dependence of names in the portfolio. This is not equal to the correlations, but we can think a little bit in that way.\n\nWhen we have an expression for a copula, (the joint probability distribution), it's good to look at these properties to see the maximum and minimum dependence, and then how to measure them, based on differences dependency metrics.\n\n== Independence\n<independence>\nThe simplest is independence.\n\nThe expression for such an independence copula is\n\n$ C\\(u_1\\,u_2\\,dots.h u_N\\)= u_1 u_2 dots.h u_N = product_(i = 1)^N u_i $\n\nIf they're independent, the joint probability distribution is the product of the marginals.\n\n== Perfect Positive Dependence\n<perfect-positive-dependence>\n== Perfect Negative Dependence\n<perfect-negative-dependence>\nWe can then state the #strong[Fréchet-Hoeffding Theorem:]\n\nFor any copula $C: [0, 1]^N arrow.r [0, 1]$\n\nand any realization $(u_1, dots.h u_N) in [0, 1]^N$, the following bounds hold:\n\n$ w\\(u_1\\,u_2 dots.h u_N\\)lt.eq C\\(u_1\\,u_2 dots.h u_N\\)lt.eq M\\(u_1\\,dots.h u_N\\) $\n\nBasically this theorem says if you have a copula with a particular realization, this copula is bounded above and below by two functions M and w.\n\nw the lower Fréchet-Hoeffding bound is\n\n$ w\\(u_1\\,dots.h u_N\\)=\\(1 - N + sum_(i = 1)^N u_i\\)_(+) $\n\nand upper bound is\n\n$ M\\(u_1\\,dots.h u_N\\)= min\\(u_1\\,dots.h u_N\\) $\n\nIn the bivariate case where we only have two variables u and v, we have\n\n$ max\\(u + v - 1\\,0\\)lt.eq C\\(u\\,v\\)lt.eq min\\(u\\,v\\) $\n\nUpper bound is perfect positive, lower bound is perfect negative.\n\nThis result holds for #strong[any copula].\n\nIdeally we would like to estimate this copula with some data. We need to make a choice for this expression, and estimate those parameters.\n\nBut the question is, this is a representation of the original joint probability distribution, but is this a unique representation? Can we have different copulas for this?\n\nWe have one more theorem, #strong[Sklar's Theorem].\n\nWe know by definition, the copula is a multivariate distribution function.\n\nAny such function can be written as a copula, and its representation is unique, the marginal distributions are continuous. If you have discrete distributions, then uniqueness is not guaranteed.\n\nLet's consider more generally, any N-dimensional distribution function H with marginal distributions F\\_1, F\\_2, F\\_N for random variables x\\_1, x\\_2, … x\\_N. H is the joint probability distribution.\n\nBecause this is multi-dimensional, this will correspond to\n\n$ H\\(x_1\\,x_2\\,dots.h x_N\\)= bb(P)\\(X_1 lt.eq x_1\\,X_2 lt.eq x_2 dots.h\\,X_N lt.eq x_N\\) $\n\nWe can write this as the probability that the marginal function F\\_1\n\n$ = bb(P)\\(F_1\\(X_1\\)lt.eq F_1\\(x_1\\)\\,F_2\\(X_2\\)lt.eq F_2\\(x_2\\)\\,dots.h F_N\\(X_N\\)lt.eq F_N\\(x_N\\)\\) $\n\nWe basically want to transform this to get a copula function, to get here from a generic N-dimensional function.\n\nLet $hat(U_i) = F_i\\(X_i\\)$ and the realization $u_i = F_i\\(x_i\\)$ The marginal will take values between 0 and 1, it's a cdf.\n\nThe original function\n\n$ H\\(x_1\\,x_2 dots.h x_N\\)= bb(P)\\(hat(U_1) lt.eq u_1\\,dots.h hat(U_N) lt.eq u_N\\) $\n\n$ H\\(x_1\\,x_2 dots.h x_N\\)= C\\(F_1\\(x_1\\)\\,F_2\\(x_2\\)dots.h F_N\\(x_n\\)\\) $\n\nWe know that C is a unique copula if these Fs are continuous.\n\nAnd in reverse,\n\n$ C\\(u_1\\,u_2 dots.h u_N\\)= H\\(F_1^(- 1)\\(u_1\\)\\,F_2^(- 1)\\(u_2\\)\\,dots.h F_N^(- 1)\\(u_N\\)\\) $\n\nThe relationship between these two is that the copula is going to separate the choice of the marginals from the choice of the dependency structures. It decouples these things. We can take any function and its copula representation, and calibrate it to the names of the portfolio independent of the dependency structure based on the way I want to assign dependency to this portfolio.\n\nWe might want to add some dynamics to this dependencies, the difference between credit default so we can calculate the conditional survival/default probability. We could impose this by choosing a different dependency structure.\n\n== Alternative to Dependence Structure of Default Times\n<alternative-to-dependence-structure-of-default-times>\nThe survival copula uses survival probabilities $s_i(t)=1-q_i(t)$:\n\n$hat(C)(s_1(t_1), dots.h, s_N(t_N))=P(tau_1>t_1, dots.h, tau_N>t_N)$.\n\nIn the bivariate case, the default and survival copulas are related by\n\n$hat(C)(u,v)=u+v-1+C(1-u,1-v)$.\n\nFor the Gaussian latent-variable model, default thresholds are jointly normal. The probability that both thresholds have been crossed is\n\n$P(tau_i<=t_i, tau_j<=t_j)=Phi_2(Phi^(-1)(q_i(t_i)), Phi^(-1)(q_j(t_j)); rho_(i,j))$.\n\nThus the Gaussian copula is\n\n$C_(rho)^(G C)(u,v)=Phi_2(Phi^(-1)(u), Phi^(-1)(v); rho)$.\n\nThe standard bivariate normal is unchanged when both variables are multiplied by $-1$. As a result, the Gaussian default and survival copulas have the same form. For a non-degenerate Gaussian copula, extreme joint events become less likely relative to their marginal tails as the thresholds move farther out: its upper- and lower-tail dependence coefficients are zero (O’Kane, Chapter 14, pp. 261–263, 269–270).\n\n== Measuring Dependence\n<measuring-dependence>\nAn important property of this is dependence, so the question is how do you measure?\n\nThere are many ways.\n\nThe most popular way is #strong[Pearson Linear Correlation].\n\n$ rho_P = frac(bb(E)[X Y] - bb(E)[X] bb(E)[Y], sqrt(bb(E)[X^2] - bb(E)[X]^2) sqrt(bb(E)[Y^2] - bb(E)[Y]^2)) $\n\nAdvantages: easier to understand. Everyone understands correlation. It is also invariant under linear transformation. Say we change the variables by scaling and shifting (multiplying and adding), it doesn't affect the correlation.\n\nFor jointly Gaussian variables, zero correlation does imply independence.\n\nHowever, there is a big disadvantage: linear correlation being 0 DOES NOT imply independence in general\n\nSometimes the correlation is abused. It is a measure of linear dependence between variables. But just because there's no linear dependence, doesn't mean there are other kinds of dependence.\n\nHere is a five-point counterexample. Let $X$ take the equally likely values $-2,-1,0,1,2$, and set $Y=X^2$. Then $E[X]=0$, $E[Y]=2$, and $E[X Y]=E[X^3]=0$, so\n\n$upright(\"Cov\")(X,Y)=E[X Y]-E[X]E[Y]=0$.\n\nYet $Y$ is completely determined by $X$. The variables are dependent, but their linear correlation is zero. This illustrates why Pearson correlation alone does not describe general dependence (O’Kane, Chapter 14, §14.3, pp. 264–265).\n\n== #strong[Rank Correlation]\n<rank-correlation>\nGiven $n$ observations $(X_i,Y_i)$, let $R_i$ and $S_i$ be the ranks of $X_i$ and $Y_i$. A pair of observations is concordant when their order agrees:\n\n$\\(X_1-X_2\\)\\(Y_1-Y_2\\)>0$.\n\nIt is discordant when the product is negative. Rank measures compare these orderings, so a monotone transformation of either variable does not change them.\n\nFor example, if five observations have identical ranks in both variables, then all $binom(5,2)=10$ pairs are concordant and none are discordant. Kendall's tau and Spearman's rho are both $1$. This spells out the perfectly ordered example in the notes (O’Kane, Chapter 14, §14.4, pp. 265–268).\n\n=== Kendall's Tau\n<kendalls-tau>\n$ tau = frac(c - d, c + d) $\n\nwhere c is the number of concordant pairs, and d is the number of discordant pairs.\n\nThen the total number of pairs is c + d, which n choose 2 = n(n-1)/2.\n\nIn the previous case, all of these are concordant, so this is 1/1.\n\nAnd if it's discordant, that's -1.\n\nThe sample estimator of Kendall's τ is\n\n$ tau = frac(2 sum_(i = 1)^(n - 1) sum_(j = i + 1)^n \"sign\"\\(\\(x_i - x_j\\)\\(y_i - y_j\\)\\), n\\(n - 1\\)) $\n\nSo basically you're enumerating all these pairs, and then dividing it by the known bottom, and flipping the 2.\n\nFor continuous variables, independence gives $tau=0$, perfect positive dependence gives $tau=1$, and perfect negative dependence gives $tau=-1$.\n\nFor a continuous x, y, Kendall's tau should be\n\n$ tau_(x y) = 4 integral_0^1 integral_0^1 C\\(u\\,v\\)d C\\(u\\,v\\)- 1 $\n\n=== Spearman's Rho\n<spearmans-rho>\nSpearman's rho is Pearson correlation applied to the ranks. With no ties, it can be calculated directly from the rank differences:\n\n$ rho_S = frac(sum_(i = 1)^n\\(R_i - macron(R)\\)\\(S_i - macron(S)\\), sqrt(sum_(i = 1)^n\\(R_i - macron(R)\\)^2) sqrt(sum_(i = 1)^n\\(S_i - macron(S)\\)^2)) = frac(12 sum_(i = 1)^n\\(R_i - macron(R)\\)\\(S_i - macron(S)\\), n\\(n^2 - 1\\)) $\n\nFurthermore, for a continuous x and y.\n\n$ rho_S = 12 integral_0^1 integral_0^1 C\\(u\\,v\\)d u d v - 3 $\n\nThis is important because for each copula it's going to be dependent, as a function of those parameters, it's going to have different values in the Pearson, Kendall or Spearman value.\n\nThere are some advantages to rank correlation, which is that it's able to capture nonlinear dependence, but it has some disadvantage as well.\n\n== Tail Dependence\n<tail-dependence>\nRank correlation records whether observations tend to move in the same or opposite order, but it does not measure the magnitude of extreme co-movements. Tail dependence asks whether one variable remains extreme when the other is already in an extreme tail.\n\nFor variables with marginal CDFs $F_X$ and $F_Y$, the upper-tail dependence coefficient is\n\n$lambda_U = lim_(u arrow.r 1) P(Y > F_Y^(-1)(u) | X > F_X^(-1)(u))$.\n\nThe lower-tail coefficient is\n\n$lambda_L = lim_(u arrow.r 0) P(Y <= F_Y^(-1)(u) | X <= F_X^(-1)(u))$.\n\nHere $u$ is a quantile level. In credit-risk terms, joint defaults correspond to the lower tail of latent asset values, while large portfolio losses correspond to the upper tail of losses. A positive coefficient means that an extreme observation in one variable has a non-vanishing limiting probability of being accompanied by an extreme observation in the other. The tail plot in the notes is illustrating this limiting behavior.\n\nThe Gaussian copula has zero upper- and lower-tail dependence for correlations strictly between $-1$ and $1$. It can match ordinary dependence while understating the chance of joint extremes; a copula with tail dependence is needed when that behavior matters (O’Kane, Chapter 14, §§14.5–14.6, pp. 269–270).","dataUrl":"https://sharifhsn.dev/api/posts/advanced-derivatives-week-13.json","date":"2025-04-24","datePublished":"2025-04-24","description":"This is going to be a basic introduction, this is a complex topic to cover comprehensively. The Gaussian latent-variable framework and conditional-independence construction are…","site":"https://sharifhsn.dev","slug":"advanced-derivatives-week-13","source":"Advanced Derivatives","sourceUrl":null,"tags":["Credit","Copulas","Dependence Modelling","Multi-Name Credit Risk"],"title":"Multi-Name Credit Risk","url":"https://sharifhsn.dev/blog/advanced-derivatives-week-13/","version":"1","wordCount":3726}