kondor imre collegium budapest s e lte rendezetlen rendszerek elte 2007 08 ii f l v n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Kondor Imre Collegium Budapest és E LTE Rendezetlen rendszerek ELTE, 2007/08 II. félév PowerPoint Presentation
Download Presentation
Kondor Imre Collegium Budapest és E LTE Rendezetlen rendszerek ELTE, 2007/08 II. félév

Loading in 2 Seconds...

play fullscreen
1 / 159

Kondor Imre Collegium Budapest és E LTE Rendezetlen rendszerek ELTE, 2007/08 II. félév - PowerPoint PPT Presentation


  • 80 Views
  • Uploaded on

Kondor Imre Collegium Budapest és E LTE Rendezetlen rendszerek ELTE, 2007/08 II. félév. Az optimalizációs és regressziós feladat zajérzékenysége – véletlen mátrixok és replikák alkalmazása. Contents. I. Preliminaries

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

Kondor Imre Collegium Budapest és E LTE Rendezetlen rendszerek ELTE, 2007/08 II. félév


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
    Presentation Transcript
    1. Kondor Imre Collegium Budapest és ELTE Rendezetlen rendszerek ELTE, 2007/08 II. félév Az optimalizációs és regressziós feladat zajérzékenysége – véletlen mátrixok és replikák alkalmazása

    2. Contents • I. Preliminaries the problem of noise, risk measures, noisy covariance matrices • II. Random matrices Spectral properties of Wigner and Wishart matrices • III. Beyond the stationary, Gaussian world non-stationary case, alternative risk measures (mean absolute deviation, expected shortfall, worst loss), their sensitivity to noise, the feasibility problem

    3. I. PRELIMINARIES

    4. Portfolios Consider a linear combination of returns with weights : . The weights add up to unity: . The portfolio’s expectation value is: with variance: where is the covariance matrix, the standard deviation of return , and the correlation matrix.

    5. Level surfaces of risk measured in variance • The covariance matrix is positive definite. It follows that the level surfaces (iso-risk surfaces) of variance are (hyper)ellipsoids in the space of weights. The convex iso-risk surfaces reflect the fact that the variance is a convex measure. • The principal axes are inversely proportional to the square root of the eigenvalues of the covariance matrix. Small eigenvalues thus correspond to long axes. • The risk free asset would correspond to an infinite axis, and the correspondig ellipsoid would be deformed into an elliptical cylinder.

    6. The Markowitz problem • According to Markowitz’ classical theory the tradeoff between risk and reward can be realized by minimizing the variance over the weights, for a given expected return and budget

    7. Geometrically, this means that we have to blow up the risk ellipsoid until it touches the intersection of the two planes corresponding to the return and budget constraints, respectively. The point of tangency is the solution to the problem. • As the solution is the point of tangency of a convex surface with a linear one, the solution is unique. • There is a certain continuity or stability in the solution: A small miss-specification of the risk ellipsoid leads to a small shift in the solution.

    8. Covariance matrices corresponding to real markets tend to have mostly positive elements. • A large, complicated matrix with nonzero average elements will have a large (Frobenius-Perron) eigenvalue, with the corresponding eigenvector having all positive components. This will be the direction of the shortest principal axis of the risk ellipsoid. • Then the solution also will have all positive components. Fluctuations in the small eigenvalue sectors may have a relatively mild effect on the solution.

    9. The minimal risk portfolio • Expected returns are hardly possible (on efficient markets, impossible) to determine with any precision. • In order to get rid of the uncertainties in the returns, we confine ourselves to considering the minimal risk portfolio only, that is, for the sake of simplicity, we drop the return constraint. • Minimizing the variance of a portfolio without considering return does not, in general, make much sense. In some cases (index tracking, benchmarking), however, this is precisely what one has to do.

    10. The weights of the minimal risk portfolio • Analytically, the minimal variance portfolio corresponds to the weights for which is minimal, given . The solution is: . • Geometrically, the minimal risk portfolio is the point of tangency between the risk ellipsoid and the plane of he budget constraint.

    11. Empirical covariance matrices • The covariance matrix has to be determined from measurements on the market. From the returns observed at time twe get the estimator: • For a portfolio of N assets the covariance matrix has O(N²) elements. The time series of length T for N assets contain NT data. In order for the measurement be precise, we need N <<T. Bank portfolios may contain hundreds of assets, and it is hardly meaningful to use time series longer than 4 years (T~1000). Therefore, N/T << 1 rarely holds in practice. As a result, there will be a lot of noise in the estimate, and the error will scale in N/T.

    12. An intriguing observation • L.Laloux, P. Cizeau, J.-P. Bouchaud, M. Potters, PRL83 1467 (1999) and Risk12 No.3, 69 (1999) and V. Plerou, P. Gopikrishnan, B. Rosenow, L.A.N. Amaral, H.E. Stanley, PRL83 1471 (1999) noted that there is such a huge amount of noise in empirical covariance matrices that it may be enough to make them useless. • A paradox: Covariance matrices are in widespread use and banks still survive ?!

    13. Laloux et al. 1999 The spectrum of the covariance matrix obtained from the time series of S&P 500 with N=406, T=1308, i.e. N/T= 0.31, compared with that of a completely random matrix (solid curve). Only about 6% of the eigenvalues lie beyond the random band.

    14. Remarks on the paradox • The number of junk eigenvalues may not necessarily be a proper measure of the effect of noise: The small eigenvalues and their eigenvectors fluctuate a lot, indeed, but perhaps they have a relatively minor effect on the optimal portfolio, whereas the large eigenvalues and their eigenvectors are fairly stable. • The investigated portfolio was too large compared with the length of the time series. • Working with real, empirical data, it is hard to distinguish the effect of insufficient information from other parasitic effects, like nonstationarity.

    15. A historical remark • Random matrices first appeared in a finance context in G. Galluccio, J.-P. Bouchaud, M. Potters, PhysicaA 259 449 (1998). In this paper they show that the optimization of a margin account (where, due to the obligatory deposit proportional to the absolute value of the positions, a nonlinear constraint replaces the budget constraint) is equivalent to finding the ground state configuration of what is called a spin glass in statistical physics. This task is known to be NP-complete, with an exponentially large number of solutions. • Problems of a similar structure would appear if one wanted to optimize the capital requirement of a bond portfolio under the rules stipulated by the Capital Adequacy Directive of the EU (see below)

    16. A filtering procedure suggested by RMT • The appearence of random matrices in the context of portfolio selection triggered a lot of activity, mainly among physicists. Laloux et al. and Plerou et al. proposed a filtering method based on random matrix theory (RMT) subsequently. This has been further developed and refined by many workers. • The proposed filtering consists basically in discarding as pure noise that part of the spectrum that falls below the upper edge of the random spectrum. Information is carried only by the eigenvalues and their eigenvectors above this edge. Optimization should be carried out by projecting onto the subspace of large eigenvalues, and replacing the small ones by a constant chosen so as to preserve the trace. This would then drastically reduce the effective dimensionality of the problem.

    17. Interpretation of the large eigenvalues: The largest one is the „market”, the other big eigenvalues correspond to the main industrial sectors. • The method can be regarded as a systematic version of principal component analysis, with an objective criterion on the number of principal components. • In order to better understand this novel filtering method, we have to recall a few results from Random Matrix Theory (RMT)

    18. II. RANDOM MATRICES

    19. Origins of random matrix theory (RMT) • Wigner, Dyson 1950’s • Originally meant to describe (to a zeroth approximation) the spectral properties of heavy atomic nuclei - on the grounds that something that is sufficiently complex is almost random -fits into the picture of a complex system, as one with a large number of degrees of freedom, without symmetries, hence irreducible, quasi random. - markets, by the way, are considered stochastic for similar reasons • Later found applications in a wide range of problems, from quantum gravity through quantum chaos, mesoscopics, random systems, etc. etc.

    20. RMT • Has developed into a rich field with a huge set of results for the spectral properties of various classes of random matrices • They can be thought of as a set of „central limit theorems” for matrices

    21. Wigner semi-circle law • Mij symmetrical NxN matrix with i.i.d. elements (the distribution has 0 mean and finite second moment) • k: eigenvalues of • The density of eigenvalues k (normed by N) goes to the Wigner semi-circle for N→∞ with prob. 1: , , otherwise

    22. Remarks on the semi-circle law • Can be proved by the method of moments (as done originally by Wigner) or by the resolvent method (Marchenko and Pastur and countless others) • Holds also for slightly dependent or non-homogeneous entries (e.g. for the association matrix in networks theory) • The convergence is fast (believed to be of ~1/N, but proved only at a lower rate), especially what concerns the support

    23. Convergence to the semi-circle as N increases

    24. N=20 Elements of M are distributed normally

    25. N=50

    26. N=100

    27. N=200

    28. N=500

    29. N=1000

    30. If the matrix elements are not centered but have, say, a common mean, one large eigenvalue breaks away, the rest stay in the semi-circle

    31. If the matrix elements are not centered N=1000

    32. N=1000

    33. For fat-tailed (but finite variance) distributions the theorem still holds, but the convergence is slow

    34. Sample from Student t (freedom=3) distribution N=20

    35. N=50

    36. N=100

    37. N=200

    38. N=500

    39. N=1000

    40. There is a lot of fluctuation, level crossing, random rotation of eigenvectors taking place in the bulk

    41. Illustration of the instability of the eigenvectors, although the distribution of the eigenvalues is the same. Sample 1 Matrix elements normally distributed N=1000

    42. Sample 2

    43. Sample k

    44. Scalar product of the eigenvectors assigned to the j. eigenvalue of the matrix.

    45. The eigenvector belonging to the large eigenvalue (when there is one) is much more stable. The larger the eigenvalue, the more so.

    46. Illustration of the stability of the largest eigenvector Sample 1 Matrix elements are normally distributed, but the sum of the elements in the rows is not zero. N=1000

    47. Sample 2

    48. Sample k

    49. Scalar product of the eigenvectors belonging to the largest eigenvalue of the matrix. The larger the first eigenvalue, the closer the scalar products to 1 or -1.

    50. The eigenvector components • A lot less is known about the eigenvectors. • Those in the bulk have random components • The one belonging to the large eigenvalue (when there is one) is completely delocalized