Volume 60, Number 4, November 2002
|Page(s)||512 - 517|
|Published online||01 November 2002|
Scale-free networks from optimal design
ICREA-Complex Systems Lab, Universitat Pompeu Fabra (GRIB)
Dr. Aiguader 80, Barcelona 08003, Spain
2 Santa Fe Institute - 1399 Hyde Park Road, NM 87501, USA
Accepted: 10 September 2002
A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being one of them. In this letter we present the first evidence for the emergence of scaling (and the presence of small-world behavior) in software architecture graphs from a well-defined local optimization process. Although the rules that define the strategies involved in software engineering should lead to a tree-like structure, the final net is scale-free, perhaps reflecting the presence of conflicting constraints unavoidable in a multidimensional optimization process. The consequences for other complex networks are outlined.
PACS: 05.10.-a – Computational methods in statistical physics and nonlinear dynamics / 05.65.+b – Self-organized systems
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.