Repository | Book | Chapter
(2015) Artificial life and computational intelligence, Dordrecht, Springer.
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.In this paper, I report on a mechanical network generation system that does produce this complexity surplus. The heart of the idea is to construct the network of state transitions of a chaotic dynamical system, such as the Lorenz equation. This indicates that complexity surplus is a more fundamental trait than that of being an evolutionary system.
Publication details
DOI: 10.1007/978-3-319-14803-8_30
Full citation:
Standish, R. K. (2015)., Mechanical generation of networks with surplus complexity, in M. Randall (ed.), Artificial life and computational intelligence, Dordrecht, Springer, pp. 387-394.
This document is unfortunately not available for download at the moment.