Rewiring Barabasi-Albert Algorithm

Described in Albert, R., and A.-L. Barabasi, 2000, Phys. Re. Lett. 85, 5234.

This algorithm is very similar to the Barabasi-Albert algorithm, except at every time step there is a probability of rewiring m nodes or adding m new edges. This graph may generate networks that more accurately represent real-world graphs than the original Barabasi-Albert algorithm.