One of the basic and yet most important global topological properties of a network is its degree distribution, \(P(k)\) : it represent the probability of a randomly chosen vertex to have \(k\)  neighbors. Figure REF  (main) shows the undirected cumulative distribution of the filtered WTW and IMN, defined as \(P_c(k)\equiv \sum _{k*>k}P(k*)\) . Trade is also considered split by products categories according to Rauch's classification. In all cases the cumulative distributions show a flat approach to the origin, indicating the presence of a maximum at \(k\sim 10\)  and, in this respect, similar to the Erdös-Rényi (ER) network; However, for \(k>10\) , the cumulative distributions follow a power law decay \(P_c(k) \sim k^{\gamma -1}\) , with \(\gamma \approx 3.0\) , showing a strong deviation from the exponential tail predicted by the classical random graph theory. The exponent \(\gamma \)  is found to be within the range defined by many other complex networks [1]}, [2]}. In fact the distributions present a power law behavior just in a very short range, especially the migration one, strongly and rapidly deviating from it. This is probably due to the hypergeometric filtering that suppress part of the links and therefore a portion of the networks heterogeneity.
<FIGURE>