This submission belongs to the session b. Information Theory of the event 1st International Electronic Conference on Entropy and Its Applications
Published date
05 Nov, 2014
Citation
Russell Kim Standish, Mechanical Generation of Networks with Surplus Complexity, in Proceedings of 1st International Electronic Conference on Entropy and Its Applications, 3 November–21 November 2014, MDPI: Basel, Switzerland, doi: 10.3390/ecea-1-b006
Share
Email
Facebook
Twitter
LinkedIn
Mechanical Generation of Networks with Surplus Complexity
Russell Kim Standish 1
1. Mathematics and Statistics, University of New South Wales
Abstract
In previous work I examined an information based complexity measureof networks with weighted links. The measure was compared with thatobtained from by randomly shuffling the original network, forming anErd\"os-R\'enyi random network preserving the original link weightdistribution. It was found that real world networks almost invariablyhad higher complexity than their shuffled counterparts, whereasnetworks mechanically generated via preferential attachment didnot. The same experiment was performed on foodwebs generated by anartificial life system, Tierra, and a couple of evolutionary ecologysystems, \EcoLab{} and WebWorld. These latter systems often exhibitedthe same complexity excess shown by real world networks, suggestingthat the {\em complexity surplus} indicates the presence ofevolutionary dynamics.In this paper, I report on a mechanical network generation systemthat does produce this complexity surplus. The heart of the idea isconstruct the network of state transitions of a chaotic dynamicalsystem, such as the Lorenz equation. This indicates that complexitysurplus is a more fundamental trait than that of being an evolutionary system.
Keywords
Complexity
graph entropy
networks
dynamical systems
chaos
cellular automata
Manuscript
ECEA-1_Mechanical Generation of Networks_Standish.pdf