This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
newman_watts_strogatz_graph(n, k, p, seed=None)¶
Return a Newman–Watts–Strogatz small-world graph.
First create a ring over
nnodes. Then each node in the ring is connected with its
knearest neighbors (or
k - 1neighbors if
kis odd). Then shortcuts are created by adding new edges as follows: for each edge
(u, v)in the underlying “
knearest neighbors” with probability
padd a new edge
(u, w)with randomly-chosen existing node
w. In contrast with
watts_strogatz_graph(), no edges are removed.
 M. E. J. Newman and D. J. Watts, Renormalization group analysis of the small-world network model, Physics Letters A, 263, 341, 1999. http://dx.doi.org/10.1016/S0375-9601(99)00757-4