Average parameters estimated by minimum distance estimator based on KL divergence for Erdös-Rényi random, scale-free, and small-world graphs.

One standard deviation is indicated between brackets. Calculations were carried out for 50 repetitions. The parameters to be estimated for each graph model are: the probability of connecting two nodes for Erdös-Rényi graphs, the power of the preferential attachment for scale-free graphs, and the rewiring probability for small-world graphs.