Figure 7:

A preferential attachment network with 5 nodes generated using the copy model. Solid lines show final decided edges, and dashed lines denote waiting of processors for node attachment to be resolved—the undecided edges. For node $t=3$, k is chosen to be 2, $F_3$ is chosen to be $k=2$, and thus edge (3, 1) is decided immediately. Similarly, edge (1, 0) is also decided immediately. For node $t=4$, k is 2 and $F_4$ is set to be $F_2$. That is, $F_4$ is dependent on $F_2$. Similarly, $F_2$ is dependent on $F_1$. Finally, we have $F_4=F_2=F_1=0$.