I have a list of parameters of a graph. Here they are:
number of nodes: 1882
radius: 15
diameter: 28
average clustering coefficient: 0.005066798238955518
average shortest path length: 11.748410823170731
number of connected components: 168
I also have empirical CDF of degree distribution:
'degree_cdf': [[0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
19,
21,
24,
46],
[0.0,
0.6902231668437833,
0.8517534537725824,
0.9086078639744952,
0.9378320935175345,
0.9516471838469713,
0.9654622741764081,
0.9723698193411264,
0.9776833156216791,
0.9808714133900106,
0.9845908607863975,
0.9888416578108395,
0.9893730074388948,
0.9925611052072264,
0.9936238044633369,
0.9952178533475027,
0.9957492029755579,
0.9968119022316685,
0.997874601487779,
0.9989373007438895,
0.9994686503719448,
1.0]]
I need to generate a random graph with parameters maximally close to those ones above. How could I define a corresponding graph? Is there any functions in networkx which would take any of those parameters as input data and create a corresponding graph?