Growth and optimality in network evolution


Brede, Markus (2011) Growth and optimality in network evolution Artificial Life, 17, (4), pp. 281-291. (doi:10.1162/artl_a_00039).

Download

[img] PDF artl_a_00039.pdf - Version of Record
Restricted to Registered users only

Download (307kB)

Description/Abstract

We investigate networks whose evolution is governed by hierarchies, scale-free networks the interaction of a random assembly process and an optimization process. In the first process, new nodes are added one at a time and form connections to randomly selected old nodes. In between node additions, the network is rewired to minimize its path length. For time scales at which neither the assembly nor the optimization processes are dominant, we find a rich variety of complex networks with power law tails in the degree distributions. These networks also exhibit nontrivial clustering, a hierarchical organization, and interesting degree-mixing patterns.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1162/artl_a_00039
Subjects:
Organisations: Agents, Interactions & Complexity
ePrint ID: 272860
Date :
Date Event
19 September 2011e-pub ahead of print
2011Published
Date Deposited: 26 Sep 2011 16:25
Last Modified: 17 Apr 2017 17:38
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272860

Actions (login required)

View Item View Item