represents a Barabasi–Albert graph distribution for n-vertex graphs where a new vertex with k edges is added at each step.
- The BarabasiAlbertGraphDistribution is constructed starting from CycleGraph, and a vertex with k edges is added at each step. The k edges are attached to vertices at random, following a distribution proportional to the vertex degree.
- BarabasiAlbertGraphDistribution can be used with such functions as RandomGraph and GraphPropertyDistribution.
Examplesopen allclose all
Introduced in 2010