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).
- Publishers print
Restricted to Registered users only
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.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||26 Sep 2011 16:25|
|Last Modified:||22 Oct 2012 13:54|
|Contributors:||Brede, Markus (Author)
|Publisher:||Massachusetts Institute of Technology|
|Further Information:||Google Scholar|
|ISI Citation Count:||1|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)