Intensity and coherence of motifs in weighted complex networks
Abstract
We propose a general approach to characterize weighted complex networks, by defining motif intensity as the geometric mean of its link weights and motif coherence as the ratio between the geometric and corresponding arithmetic mean. Quantities like clustering coefficient and motif scores, studied extensively on unweighted networks, can be readily generalized to the weighted cases using these measures. We apply these concepts to study model, undirected financial, and directed metabolic networks, and find features not detected by other means.Keywords
All Related Versions
This publication has 0 references indexed in Scilit: