%0 Journal Article %1 Barthelemy2006 %A Barthélemy, Marc %A Flammini, Alessandro %D 2006 %I Institute of Physics Publishing %J Journal of Statistical Mechanics: Theory and Experiment %K graphs networks optimization traffic weighted-networks %N 07 %P L07002 %R 10.1088/1742-5468/2006/07/L07002 %T Optimal traffic networks %V 2006 %X Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.

@article{Barthelemy2006, abstract = {Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.}, added-at = {2011-06-14T14:39:36.000+0200}, author = {Barthélemy, Marc and Flammini, Alessandro}, biburl = {https://www.bibsonomy.org/bibtex/2cc33d502ea74ed46bca7a16f3f46a187/rincedd}, doi = {10.1088/1742-5468/2006/07/L07002}, interhash = {91a918c2dad6e3fb4ebed7b2d2f884a5}, intrahash = {cc33d502ea74ed46bca7a16f3f46a187}, journal = {Journal of Statistical Mechanics: Theory and Experiment}, keywords = {graphs networks optimization traffic weighted-networks}, number = 07, pages = {L07002}, publisher = {Institute of Physics Publishing}, timestamp = {2011-06-14T14:39:37.000+0200}, title = {Optimal traffic networks}, volume = 2006, year = 2006 }