Network motifs in computational graphs: a case study in software architecture

Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Aug;72(2 Pt 2):026107. doi: 10.1103/PhysRevE.72.026107. Epub 2005 Aug 8.

Abstract

Complex networks in both nature and technology have been shown to display characteristic, small subgraphs (so-called motifs) which appear to be related to their underlying functionality. All these networks share a common trait: they manipulate information at different scales in order to perform some kind of computation. Here we analyze a large set of software class diagrams and show that several highly frequent network motifs appear to be a consequence of network heterogeneity and size, thus suggesting a somewhat less relevant role of functionality. However, by using a simple model of network growth by duplication and rewiring, it is shown the rules of graph evolution seem to be largely responsible for the observed motif distribution.