Relation between Financial Market Structure and the Real Economy: Comparison between Clustering Methods

Abstract

We quantify the amount of information filtered by different hierarchical clustering methods on correlations between stock returns comparing it with the underlying industrial activity structure. Specifically, we apply, for the first time to financial data, a novel hierarchical clustering approach, the Directed Bubble Hierarchical Tree and we compare it with other methods including the Linkage and k-medoids. In particular, by taking the industrial sector classification of stocks as a benchmark partition, we evaluate how the different methods retrieve this classification. The results show that the Directed Bubble Hierarchical Tree can outperform other methods, being able to retrieve more information with fewer clusters. Moreover, we show that the economic information is hidden at different levels of the hierarchical structures depending on the clustering method. The dynamical analysis on a rolling window also reveals that the different methods show different degrees of sensitivity to events affecting financial markets, like crises. These results can be of interest for all the applications of clustering methods to portfolio optimization and risk hedging.

31 pages, 17 figures

References in corpus (7)

• A tool for filtering information in complex systems
• Correlation based networks of equity returns sampled at different time horizons
• Mutual Information Rate-Based Networks in Financial Markets
• Spanning Trees and bootstrap reliability estimation in correlation based networks
• Kullback-Leibler distance as a measure of the information filtered from multivariate data
• Multi-scale correlations in different futures markets
• Dynamic Multi-Factor Clustering of Financial Networks

Cited by in corpus (6)

• Parsimonious modeling with Information Filtering Networks
• Dynamic correlations at different time-scales with Empirical Mode Decomposition
• Correlations and Clustering in Wholesale Electricity Markets
• Learning Clique Forests
• A memory-based method to select the number of relevant components in Principal Component Analysis
• Asset Selection via Correlation Blockmodel Clustering