This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
barabasi_albert_graph(n, m, seed=None)[source]¶
Returns a random graph according to the Barabási–Albert preferential attachment model.
A graph of
nnodes is grown by attaching new nodes each with
medges that are preferentially attached to existing nodes with high degree.
Return type: Raises:
mdoes not satisfy
1 <= m < n.
 A. L. Barabási and R. Albert “Emergence of scaling in random networks”, Science 286, pp 509-512, 1999.