A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Proceedings of 1st International Electronic Conference on Entropy and Its Applications
In previous work I examined an information based complexity measure of networks with weighted links. The measure was compared with that obtained from by randomly shuffling the original network, forming an Erdös-Rényi random network preserving the original link weight distribution. It was found that real world networks almost invariably had higher complexity than their shuffled counterparts, whereas networks mechanically generated via preferential attachment did not. The same experiment wasdoi:10.3390/ecea-1-b006 fatcat:w7fgj6hmczcs3n7tmxftd7pyzu