ABSTRACT
The comonotonicity and countermonotonicity provide intuitive upper and lower dependence relationship between random variables. This paper constructs the shuffle of min’s random variable approximations for a given Uniform [0, 1] random vector. We find the two optimal orders under which the shuffle of min’s random variable approximations obtained are shown to be extensions of comonotonicity and countermonotonicity. We also provide the rate of convergence of these random vectors approximations and apply them to compute value-at-risk.
Mathematics Subject Classification:
Acknowledgments
We thank reviewers for their valuable comments.
Appendix A
We first prove the following lemma before the proof of Theorem 3.1.
Lemma 4.1.
If , then we have (A1) If , then we have (A2)
Proof.
Based on the fact that , it is easy to obtain Equations (EquationA1(A1) ) and (EquationA2(A2) ) from Equation (Equation3.5(3.5) ).
Proof of Theorem 3.1.
We only give the proof of the case . It is similar to prove the case . It is equal to show the inverse negative proposition. That is, we will prove that if there exists h, k such that , , ∀i ≠ h, j ≠ k and , i, j ∈ {0, 1, …, m − 1}, denoting , then is not the maximum Spearman’s rho. In fact, we will show .
Combining Equation (Equation3.7(3.7) ) with Lemma 4.1, we have Then (A3) Suppose . By comparing with , there are only σ(1)h(k) ≠ σh(1)*(k) and σ(1)h(l) ≠ σh(1)*(l). Thus, Equation (EquationA3(A3) ) becomes Based on the end points in Equation (Equation3.4(3.4) ), it is easy to compute that where D1 = ∑l − 1q = k + 1P(Ah, q) + 2∑k − 1q = 0P(Ah, q). Thus . The conclusion comes.