Growth and optimality in network evolution


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

Download

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

Download (299Kb) | Request a copy

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
ISSNs: 1064-5462 (print)
1530-9185 (electronic)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 272860
Accepted Date and Publication Date:
Status
2011Published
19 September 2011Made publicly available
Date Deposited: 26 Sep 2011 16:25
Last Modified: 31 Mar 2016 14:22
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272860

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics