Identification of complex networks by the method of stages

In this paper, a weighted directed random graph is used as network model. The graph contains a fixed number N of nodes and a variable number of edges: in particular, each edge is present with probability p. Some statistical properties (such as strong connection, global and local efficiency, cost, etc) are computed and their reliance on probability p is studied. Some probability distributions (such as shortest path, edge (node) load) are also drawn and, by using the method of stages, the best fitting curves are computed. Finally, the way as parameters characterizing such curves change when p varies is investigated.