Right now the Monte Carlo/bootstrapping method for calculating the probability that a real power law distribution would have created the observed data (the p-value) is not implemented. The reasons for this are two-fold:
1. I think it is insufficient and frequently unnecessary.
2. It is sloooow to run.
The reason for the slowness is that we generate samples of synthetic data and refit that data, and that refitting takes time. In order to estimate the p-value with much statistical power you'll need to run at least 1,000 synthetic samples. So if you have a dataset that originally took 10 seconds to fit, it will take nearly 3 hours to calculate a p-value. This problem is obviously worse the the larger your original dataset was, as the run time scales with (number_of_data_points * number_of_samples).
With all that said, it is not hard to implement. Adam Ginsburg has an implementation here:
The function is "test_pl". The important bit is lines 520-542.
I have now received multiple questions about the bootstrapping method, since Clauset et al. discuss it at length. I'm ambivalent about whether to implement it in powerlaw. On the one hand there is interest, but on the other hand I think it is usually distracting and will likely lead people to stop with a p-value before they've considered alternative distributions.
With that said, if someone submits a Github pull request with a well-integrated implementation of the bootstrapping, I'll put it in.