Analysis of weakly correlated nodes in market network

The aim of the article is to analyze graphs of weakly correlated stocks. Characteristics of these graphs such as number of edges, histogram of vertices degrees, degrees distribution, hubs and cliques are investigated. Pearson correlation and Kendall correlation are used to construct these graphs. Graphs constructed by the traditional procedure and by Holm procedure are compared. Obtained results are exemplified on the data of French stock market. In particular it is shown that reliable maximum cliques contain very few nodes despite the large number of edges in the graph of weakly correlated stocks.