Minimal spanning tree problem in stock networks analysis: An efficient algorithm

Since the last decade, minimal spanning trees (MSTs) have become one of the main streams in econophysics to filter the important information contained, for example, in stock networks. The standard practice to find an MST is by using Kruskal’s algorithm. However, it becomes slower and slower when the number of stocks gets larger and larger. In this paper we propose an algorithm to find an MST which has considerably promising performance. It is significantly faster than Kruskal’s algorithm and far faster if there is only one unique MST in the network. Our approach is based on the combination of fuzzy relation theory and graph theoretical properties of the forest of all MSTs. A comparison study based on real data from four stock markets and four types of simulated data will be presented to illustrate the significant advantages of the proposed algorithm.