
As can be seen, for small values of the strength distribution is almost indistinguishable from the degree distribution, while as increases the two quantities become increasingly different.


The theoretical curves predicted by the weighted random graph model would be a cumulative geometric distribution with parameter, a cumulative binomial distribution with parameters and a cumulative negative binomial distribution with parameters, respectively. Besides the visualization of the graph, the fundamental topological properties are shown: the observed cumulative weight distribution (in red), the observed cumulative degree distribution (in green), and the observed cumulative strength distribution (in orange). A larger number of vertices would make the graph an indistinguishable ensemble of lines. In this Demonstration only graphs with a small number of vertices can be generated.

This Demonstration implements the WRG model as a function of the number of vertices and the parameter controlling the average weight.
