![[CAIDA - Cooperative Association for Internet Data Analysis logo]](/images/caida_globe_faded.png)
![[CAIDA]](/images/caida_whitewords.png "Go to CAIDA home page"){kind=small}
Supplemental text on dK-series and dK annnotations is available.
How Small Are Building Blocks of Complex Networks
A. Jamakovic, P. Mahadevan, A. Vahdat, M. Boguna, and D. Krioukov
Cooperative Association for Internet Data Analysis - CAIDA
San Diego Supercomputer Center,
University of California, San Diego
Network motifs are small building blocks of complex networks, such as gene regulatory networks. The frequent appearance of a motif may be an indication of some network-specific utility for that motif, such as speeding up the response times of gene circuits. However, the precise nature of the connection between motifs and the global structure and function of networks remains unclear. Here we show that the global structure of some real networks is statistically determined by the distributions of local motifs of size at most 3, once we augment motifs to include node degree information. That is, remarkably, the global properties of these networks are fixed by the probability of the presence of links between node triples, once this probability accounts for the degree of the individual nodes. We consider a social web of trust, protein interactions, scientific collaborations, air transportation, the Internet, and a power grid. In all cases except the power grid, random networks that maintain the degree-enriched connectivity profiles for node triples in the original network reproduce all its local and global properties. This finding provides an alternative statistical explanation for motif significance. It also impacts research on network topology modeling and generation. Such models and generators are guaranteed to reproduce essential local and global network properties as soon as they reproduce their 3-node connectivity statistics.