Methods for creating scale-free networks without resorting to global knowledge
Aldridge, Colin H
Cite this item:
Aldridge, C. H. (2005). Methods for creating scale-free networks without resorting to global knowledge (pp. 169–173). Presented at the 17th Annual Colloquium of the Spatial Information Research Centre (SIRC 2005: A Spatio-temporal Workshop).
Permanent link to OUR Archive version:
http://hdl.handle.net/10523/694
Abstract:
This paper is a progress report on investigations into methods for evolving scalefree networks using less-than-global knowledge of network characteristics. The motivation for this work is the reliance on global knowledge by the now wellknown Albert-Barabási algorithm for evolving fat-tailed networks exhibiting powerlaw node degree distributions. This paper examines three approaches, namely tournament selection, a deterministic walk, and a stochastic walk. These methods yield fat-tailed node degree distributions to a greater or lesser extent, but not "classic" power-law distributions. The investigation is on-going.
Date:
2005-11
Conference:
17th Annual Colloquium of the Spatial Information Research Centre (SIRC 2005: A Spatio-temporal Workshop), Dunedin, New Zealand
Keywords:
scale-free networks; evolution network algorithms
Research Type:
Conference or Workshop Item (Paper)