Growth and optimality in network evolution

Artif Life. 2011 Fall;17(4):281-91. doi: 10.1162/artl_a_00039. Epub 2011 Jul 15.

Abstract

We investigate networks whose evolution is governed by 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.

MeSH terms

  • Algorithms
  • Models, Theoretical*