Here's the first batch job for the Laplacian paper: average transitivity vs. time for 1000 powerlaw graphs of 100 vertices:

It's an interesting curve - it confirms what I thought I was seeing: that it rises quickly to a fairly small number and then drops off again. This is for the edge sampling process, which I don't find all that promising. I'm looking forward to getting averages from the fully stochastic process.