Clustering and information in correlation based financial networks
J.-P. Onnela, K. Kaski, J. Kertesz

TL;DR
This paper investigates the structure of financial networks built from stock return correlations, revealing early cycle formation and high clustering in empirical data compared to random graphs, indicating significant market networking.
Contribution
It introduces a method to construct asset graphs based on correlation ranks and analyzes their topological properties, highlighting differences from random graphs and the informational content of edges.
Findings
Empirical asset graphs form cycles earlier than random graphs.
Number of clusters in empirical graphs is much lower than in random graphs.
Most market information is contained within the top 10% of correlation-based edges.
Abstract
Networks of companies can be constructed by using return correlations. A crucial issue in this approach is to select the relevant correlations from the correlation matrix. In order to study this problem, we start from an empty graph with no edges where the vertices correspond to stocks. Then, one by one, we insert edges between the vertices according to the rank of their correlation strength, resulting in a network called asset graph. We study its properties, such as topologically different growth types, number and size of clusters and clustering coefficient. These properties, calculated from empirical data, are compared against those of a random graph. The growth of the graph can be classified according to the topological role of the newly inserted edge. We find that the type of growth which is responsible for creating cycles in the graph sets in much earlier for the empirical asset…
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.
