represents the Watts–Strogatz graph distribution for n-vertex graphs with rewiring probability p.
represents the Watts–Strogatz graph distribution for n-vertex graphs with rewiring probability p starting from a 2k-regular graph.
- WattsStrogatzGraphDistribution[n,p] is equivalent to WattsStrogatzGraphDistribution[n,p,2].
- The WattsStrogatzGraphDistribution is constructed starting from CirculantGraph[n,Range[k]] and rewiring each edge with probability p. Each edge is rewired by changing one of the vertices, making sure that no loop or multiple edge is created.
- WattsStrogatzGraphDistribution can be used with such functions as RandomGraph and GraphPropertyDistribution.
Examplesopen allclose all
Basic Examples (2)
GlobalClusteringCoefficient as a function of rewiring probability: