Optimal decision for the market graph identification problem in a sign similarity network
- 157 Downloads
Research into the market graph is attracting increasing attention in stock market analysis. One of the important problems connected with the market graph is its identification from observations. The standard way of identifying the market graph is to use a simple procedure based on statistical estimations of Pearson correlations between pairs of stocks. Recently a new class of statistical procedures for market graph identification was introduced and the optimality of these procedures in the Pearson correlation Gaussian network was proved. However, the procedures obtained have a high reliability only for Gaussian multivariate distributions of stock attributes. One of the ways to correct this problem is to consider different networks generated by different measures of pairwise similarity of stocks. A new and promising model in this context is the sign similarity network. In this paper the market graph identification problem in the sign similarity network is reviewed. A new class of statistical procedures for the market graph identification is introduced and the optimality of these procedures is proved. Numerical experiments reveal an essential difference in the quality between optimal procedures in sign similarity and Pearson correlation networks. In particular, it is observed that the quality of the optimal identification procedure in the sign similarity network is not sensitive to the assumptions on the distribution of stock attributes.
KeywordsPearson correlation network Sign similarity network Market graph Multiple decision statistical procedures Loss function Risk function Optimal multiple decision procedures
The work has been conducted at the Laboratory of Algorithms and Technologies for Network Analysis of the National Research University Higher School of Economics. V. A. Kalyagin and A. P. Koldanov are partially supported by RFFI Grant 14-01-00807, and P. A. Koldanov is partially supported by RFHR Grant 15-32-01052.
- Bautin, G. A., Kalyagin, V. A., & Koldanov, A. P. (2013). Comparative analysis of two similarity measures for the market graph construction. In Proceedings in mathematics and statistics (Vol. 59, pp. 29–41). Springer.Google Scholar
- Boginsky, V., Butenko, S., & Pardalos, P. M. (2003). On structural properties of the market graph. In A. Nagurney (Ed.), Innovations in financial and economic networks (pp. 29–45). Northampton: Edward Elgar Publishing Inc.Google Scholar
- Cesarone, F., Scozzari, A., & Tardella, F. (2015). A new method for mean-variance portfolio optimization with cardinality constraints. Annals of Operations Research, 215, 213–234.Google Scholar
- Emmert-Streib, F., & Dehmer, M. (2010). Identifying critical financial networks of the DJIA: Towards a network based index. Complexity, 16(1), 24–33.Google Scholar
- Gunawardena, A. D. A., Meyer, R. R., Dougan, W. L., Monaghan, P. E., & ChotonBasu, P. E. M. (2012). Optimal selection of an independent set of cliques in a market graph. In: International proceedings of economics development and research (Vol. 29, p. 281285).Google Scholar
- Huffner, F., Komusiewicz, C., Moser, H., & Niedermeier, R. (2008). Enumerating isolated cliques in synthetic and financial networks. In Combinatorial optimization and applications, lecture notes in computer science (Vol. 5165, pp. 405–416).Google Scholar
- Kramer, H. (1962). Mathematical methods of statistics (9th ed.). Princeton: Princeton University Press.Google Scholar
- Lehmann, E. L., & Romano, J. P. (2005). Testing statistical hypotheses. New York: Springer.Google Scholar
- Mantegna, R. N. (1999). Hierarchical structure in financial markets. European Physical Journal, Series B, 11, 93–97.Google Scholar
- Wald, A. (1950). Statistical decision function. New York: Wiley.Google Scholar