The correlation of metrics in complex networks with applications in functional brain networks

Abstract

Abstract. An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients between widely studied network metrics in three network models (Bárabasi-Albert graphs, Erdös-Rényi random graphs and Watts-Strogatz small-world graphs) as well as in functional brain networks of healthy subjects. The metric correlations, which we have observed and theoretically explained, motivate us to propose a small representative set of metrics by including only one metric from each subset of mutually strongly dependent metrics. The following contributions are considered important. The correlation of metrics in complex networks with applications in functional brain networks metrics so far, the average shortest path length and the clustering coefficient, are strongly correlated and, thus, redundant. Whereas spectral metrics, though only studied recently in the context of complex networks, seem to be essential in network characterizations. This representative set of metrics tends to both sufficiently and effectively characterize networks with a given degree distribution.In the study of a specific network, however, we have to at least consider the representative set so that important network properties will not be neglected.

Robustness envelopes of networks

“…The measure M A,B (k) is different from the scalar correlation of topological metrics [39]. When we compare all the nodes (k = 100%), we have a full overlap and M A,B (100%) = 1.…”

The trees and the forest: Characterization of complex brain networks with minimum spanning trees

“…It is very likely however, that these measures are highly correlated and can be replaced by a smaller number of more independent measures. A simulation study showed that most graph measures can be clustered into 2 to 4 groups, depending upon the topology of the underlying network (Li et al, 2011). For example, in the case of Erdős Rényi random graphs a strong correlation between the clustering coefficient and the average shortest path length can be expected.…”

Multi-level reconfigurable self-organization in overlay services

“…Similarly, every vertex in a tree graph has a depth. Selecting and studying graph properties of networks is a challenging problem as illustrated by Li et al [2011]. This chapter focuses on trees with specific graph properties that influence the performance of several distributed applications.…”