25.06.2013 Views

statistique, théorie et gestion de portefeuille - Docs at ISFA

statistique, théorie et gestion de portefeuille - Docs at ISFA

statistique, théorie et gestion de portefeuille - Docs at ISFA

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

9.2. Estim<strong>at</strong>ion du coefficient <strong>de</strong> dépendance <strong>de</strong> queue 311<br />

3.2 Calibr<strong>at</strong>ion of the factor mo<strong>de</strong>l<br />

The d<strong>et</strong>ermin<strong>at</strong>ion of the param<strong>et</strong>ers β and of the residues ε entering in the <strong>de</strong>finition of the factor<br />

mo<strong>de</strong>l (6) is performed for each ass<strong>et</strong> by regressing the stocks r<strong>et</strong>urns on the mark<strong>et</strong> r<strong>et</strong>urn. The<br />

coefficient β is thus given by the ordinary least square estim<strong>at</strong>or, which is consistent as long as<br />

the residues are weak white noise and with zero mean and finite variance. The idiosyncr<strong>at</strong>ic noise<br />

ε is obtained by substracting β times the mark<strong>et</strong> r<strong>et</strong>urn to the stock r<strong>et</strong>urn. Table 2 presents<br />

the results for the three periods we consi<strong>de</strong>r. For each period, we give the value of the estim<strong>at</strong>ed<br />

coefficient β (first columns of table 2 for each time interval). We then calcul<strong>at</strong>e the correl<strong>at</strong>ion<br />

coefficient b<strong>et</strong>ween the mark<strong>et</strong> r<strong>et</strong>urns and the estim<strong>at</strong>ed idiosyncr<strong>at</strong>ic noise. All of them are less<br />

than 10 −8 , so th<strong>at</strong> none of them is significantly different from zero, which allows us to conclu<strong>de</strong><br />

th<strong>at</strong> there is no linear correl<strong>at</strong>ion b<strong>et</strong>ween the factor and the residues. To check one step further<br />

the in<strong>de</strong>pen<strong>de</strong>nce hypothesis, we have estim<strong>at</strong>ed the correl<strong>at</strong>ion coefficient b<strong>et</strong>ween the square of<br />

the factor and the square of the error-terms. In table 2, their values are given in the second of the<br />

pair of columns presented for each period. A Fisher’s test shows th<strong>at</strong>, <strong>at</strong> the 95% confi<strong>de</strong>nce level,<br />

all these correl<strong>at</strong>ion coefficients are significantly different from zero. This result is not surprising<br />

and shows the existence of small but significant correl<strong>at</strong>ions b<strong>et</strong>ween the mark<strong>et</strong> vol<strong>at</strong>ility and<br />

the idiosyncr<strong>at</strong>ic vol<strong>at</strong>ility. However, this will not invalid<strong>at</strong>e the empirical tests of our theor<strong>et</strong>ical<br />

results, since they hold even in presence of weakly <strong>de</strong>pen<strong>de</strong>nt factor and noise.<br />

The coefficient β’s we obtain by regressing each ass<strong>et</strong> r<strong>et</strong>urns on the Standard & Poor’s 500 r<strong>et</strong>urns<br />

are very close to within their uncertainties to the β’s given by the CRSP d<strong>at</strong>abase, which are<br />

estim<strong>at</strong>ed by regressing the ass<strong>et</strong>s r<strong>et</strong>urns on the value-weighted mark<strong>et</strong> portfolio. Thus, the choice<br />

of the Standard and Poor’s 500 in<strong>de</strong>x to represent the whole mark<strong>et</strong> portfolio is reasonable.<br />

3.3 Estim<strong>at</strong>ion of the tail in<strong>de</strong>xes<br />

Assuming th<strong>at</strong> the distributions of stocks and mark<strong>et</strong> r<strong>et</strong>urns are asymptotically power laws (Longin<br />

(1996), Lux (1996), Pagan (1996) or Gopikrishnan, Meyer, Amaral, and Stanley (1998)), we now<br />

estim<strong>at</strong>e the tail in<strong>de</strong>x of the distribution of each stock and their corresponding residue by the factor<br />

mo<strong>de</strong>l, both for the positive and neg<strong>at</strong>ive tails. Each tail in<strong>de</strong>x α is given by Hill’s estim<strong>at</strong>or:<br />

ˆα =<br />

⎡<br />

⎣ 1<br />

k<br />

⎤<br />

k<br />

log xj,N − log xk,N⎦<br />

j=1<br />

−1<br />

, (21)<br />

where x1,N ≥ x2,N ≥ · · · ≥ xN,N <strong>de</strong>notes the or<strong>de</strong>red st<strong>at</strong>istics of the sample containing N in<strong>de</strong>pen<strong>de</strong>nt<br />

and i<strong>de</strong>ntically distributed realiz<strong>at</strong>ions of the variable X.<br />

Hill’s estim<strong>at</strong>or is asymptotically normally distributed with mean α and variance α 2 /k. But,<br />

for finite k, it is known th<strong>at</strong> the estim<strong>at</strong>or is biased. As the range k increases, the variance of the<br />

estim<strong>at</strong>or <strong>de</strong>creases while its bias increases. The comp<strong>et</strong>ition b<strong>et</strong>ween these two effects implies th<strong>at</strong><br />

there is an optimal choice for k = k ∗ which minimizes the mean squared error of the estim<strong>at</strong>or.<br />

To select this value k ∗ , one can apply the Danielsson and <strong>de</strong> Vries (1997)’s algorithm which is an<br />

improvement over the Hall (1990)’s subsample bootstrap procedure. One can also prefer the more<br />

recent Danielsson, <strong>de</strong> Haan, Peng, and <strong>de</strong> Vries (2001)’s algorithm for the sake of parsimony. We<br />

have tested all three algorithms to d<strong>et</strong>ermine the optimal k ∗ . It turns out th<strong>at</strong> the Danielsson,<br />

<strong>de</strong> Haan, Peng, and <strong>de</strong> Vries (2001)’s algorithm <strong>de</strong>veloped for high frequency d<strong>at</strong>a is not well<br />

adapted to samples containing less than 100,000 d<strong>at</strong>a points, as is the case here. Thus, we have<br />

focused on the two other algorithms. An accur<strong>at</strong>e d<strong>et</strong>ermin<strong>at</strong>ion of k ∗ is r<strong>at</strong>her difficult with any of<br />

12

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!