Some methods have been introduced to generate such classes of networks for non-growing (Watts & Strogatz, 1998) or growing networks (Klemm & Eguíluz, 2002). However, those methods lacks power in differentiating the local order/disorder as given by the clustering coefficient from the global order/randomness as expressed by the degree distribution of the networks.
We introduce here a simple method to generate small-world networks from non-growing networks for virtually any fixed degree distribution. This demonstrates that the small world property does not only arise at the interface of order and random networks, but is, on the contrary, independent of any manipulation the degree distribution or of its ‘order’.