Spectral methods and cluster structure in correlation-based networks
Tapio Heimo, Gergely Tibely, Jari Saramaki, Kimmo Kaski, Janos Kertesz

TL;DR
This paper explores how spectral analysis of correlation matrices from financial data reflects underlying network clusters, revealing limitations and robustness of asset graph methods in identifying sector structures.
Contribution
It demonstrates that eigenpair analysis alone cannot reliably uncover cluster structures without prior knowledge and evaluates the noise sensitivity of asset graphs in correlation networks.
Findings
Eigenvectors correspond to market and sector structures.
Eigenpair analysis alone is insufficient for cluster detection.
Asset graphs show robustness to noise without sharp percolation transitions.
Abstract
We investigate how in complex systems the eigenpairs of the matrices derived from the correlations of multichannel observations reflect the cluster structure of the underlying networks. For this we use daily return data from the NYSE and focus specifically on the spectral properties of weight W_{ij} = |C|_{ij} - \delta_{ij} and diffusion matrices D_{ij} = W_{ij}/s_j- \delta_{ij}, where C_{ij} is the correlation matrix and s_i = \sum_j W_{ij} the strength of node j. The eigenvalues (and corresponding eigenvectors) of the weight matrix are ranked in descending order. In accord with the earlier observations the first eigenvector stands for a measure of the market correlations. Its components are to first approximation equal to the strengths of the nodes and there is a second order, roughly linear, correction. The high ranking eigenvectors, excluding the highest ranking one, are usually…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
