Following up my previous notebook post, I have the average transitivity vs. time for 100 of the same powerlaw graphs as before, but now using the fully stochastic process:
In the other process, transitivity increases to a small amount and then declines back to zero. In this one it increases steadily from zero (no clustering in the network) to one (complete clustering).
This figure is on the wiki with everything else. I ran this one offline, but I hope to have all the code running in the usual reproducible way on the wiki soon.