FIGURE 2 

A simulation of the aggregation of random (Erdös-Rényi) graphs showing rapid reconstitution of a scale-free degree distribution. The simulation involved a set of random labels (contexts), L, distributed across N=1000 nodes, subject to the additional condition that the number of labels per node follows a power-law distribution. Displayed results are the average of 100 trials, showing degree distribution after aggregating L=1, 25, 50, 75, and 100 labels. In our simulation, we assume that two nodes sharing a given context have a fixed probability of interaction (P=0.05), thus any context-specific sub-network is a random (Erdös-Rényi) graph.