Scale-free Networks from Optimal Design
S. Valverde, R. Ferrer i Cancho, R. V. Sole
Abstract
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 smallworldness) 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.
Create a lesson
Related papers
Real-Space renormalization for the drawups and drawdowns of stochastic trajectories: universality classes for diffusion processes and random walks via the scale function
Cecile Monthus
Stochastic synthesis and degradation of arbitrary diffusive processes
Denis Boyer, Gabriel Mercado-Vásquez
Critical amplitudes of the Baxter-Wu model from MCPA and Wolff simulations: free-exponent and fixed-exponent fits
Vyacheslav Mozolenko, Ian Pile, Lev Shchur
Capillary Coarsening Drives Re-entrant Statistical Transitions in Early Coffee-Ring Growth
Arundas Chandradasan, Dileep Mampallil
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo