Intensity and coherence of motifs in weighted complex networks
Abstract
We propose a general approach to characterize complex networks where the links between the nodes bear (normalized) weights. The intensity of a motif is defined as the geometric mean of the weights of links in the motif, and its coherence is given by the ratio between the geometric and the arithmetic mean. Quantities like clustering coefficient or motif scores, which have been studied extensively on networks without weights, can be readily generalized to the weighted cases using the above measures. We apply the concepts to study model, correlation based, and metabolic networks.Keywords
All Related Versions
This publication has 0 references indexed in Scilit: