Intensity and coherence of motifs in weighted complex networks

The local structure of unweighted networks can be characterized by the number of times a subgraph appears in the network. The clustering coefficient, reflecting the local configuration of triangles, can be seen as a special case of this approach. In this paper we generalize this method for weighted ... View More