barabasi_albert_graph(n, m, seed=None)¶
Returns a random graph according to the Barabási–Albert preferential attachment model.
A graph of \(n\) nodes is grown by attaching new nodes each with \(m\) edges that are preferentially attached to existing nodes with high degree.
- n (int) – Number of nodes
- m (int) – Number of edges to attach from a new node to existing nodes
- seed (integer, random_state, or None (default)) – Indicator of random number generation state. See Randomness.
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.