There have been a few questions (and subsequent answers) regarding the generation of networks (graphs) with a fixed edge density (see e.g., here and here), and these are mostly based on the methods put forward by Bansal et al. (2009). Yet, for my specific problem I am interested in generating networks with a desired global clustering coefficient and a desired average path length.
The path length here is the average (shortest) distance between each nodes, which is therefore expensive to compute.
In principle, I would like to fix the average path length while being able to ‘tune’ the clustering coefficient to be (close to a) desired value, or vice versa.