Papers › Construction of Minimum Spanning Trees from Financial Returns using Rank Correlation
Construction of Minimum Spanning Trees from Financial Returns using Rank Correlation
Tristan Millington, Mahesan Niranjan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The construction of minimum spanning trees (MSTs) from correlation matrices is an often used method to study relationships in the financial markets. However most of the work on this topic tends to use the Pearson correlation coefficient, which relies on the assumption of normality and can be brittle to the presence of outliers, neither of which is ideal for the study of financial returns. In this paper we study the inference of MSTs from daily US, UK and German financial returns using Pearson and two rank correlation methods, Spearman and Kendall's τ. MSTs constructed using these rank methods tend to be more stable and maintain more edges over the dataset than those constructed using Pearson correlation. The edge agreement between the Pearson and rank MSTs varies significantly depending on the state of the markets, but the rank MSTs generally show strong agreement at all times. Deviation from univariate normality can be related to changes in the correlation matrices but is more difficult to connect to changes in the MSTs. Irrelevant of coefficient, the trees tend to have similar topologies. Portfolios constructed from the MST correlation matrices have a smaller turnover than those from the full covariance matrix for the larger markets, but not for the smaller German market. Using a bootstrap method we find that the correlation matrices constructed using the rank correlations are more robust, but there is little difference between the robustness of the MSTs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections