Exploring the Morphospace of Communication Efficiency in Complex Networks

被引:108
作者
Goni, Joaquin [1 ]
Avena-Koenigsberger, Andrea [1 ]
de Mendizabal, Nieves Velez [2 ,3 ]
van den Heuvel, Martijn P. [4 ,5 ]
Betzel, Richard F. [1 ]
Sporns, Olaf [1 ]
机构
[1] Indiana Univ, Dept Psychol & Brain Sci, Bloomington, IN 47405 USA
[2] Indiana Univ, Dept Med, Indianapolis, IN USA
[3] Indiana Clin & Translat Sci Inst, Indianapolis, IN USA
[4] Univ Med Ctr Utrecht, Dept Psychiat, Utrecht, Netherlands
[5] Rudolf Magnus Inst Neurosci, NL-3508 TA Utrecht, Netherlands
关键词
SMALL-WORLD; OPTIMIZATION;
D O I
10.1371/journal.pone.0058070
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the network, but also on the nature of the system's dynamics which are constrained by the amount of knowledge and resources available for communication processes. Complementing widely used measures that capture efficiency under the assumption that communication preferentially follows shortest paths across the network ("routing''), we define analytic measures directed at characterizing network communication when signals flow in a random walk process ("diffusion''). The two dimensions of routing and diffusion efficiency define a morphospace for complex networks, with different network topologies characterized by different combinations of efficiency measures and thus occupying different regions of this space. We explore the relation of network topologies and efficiency measures by examining canonical network models, by evolving networks using a multi-objective optimization strategy, and by investigating real-world network data sets. Within the efficiency morphospace, specific aspects of network topology that differentially favor efficient communication for routing and diffusion processes are identified. Charting regions of the morphospace that are occupied by canonical, evolved or real networks allows inferences about the limits of communication efficiency imposed by connectivity and dynamics, as well as the underlying selection pressures that have shaped network topology.
引用
收藏
页数:10
相关论文
共 44 条
[1]  
[Anonymous], 2004, SIGKDD Explorations, DOI [10.1145/988672.988739, DOI 10.1145/1046456.1046462]
[2]   Communication in networks with hierarchical branching [J].
Arenas, A ;
Díaz-Guilera, A ;
Guimerà, R .
PHYSICAL REVIEW LETTERS, 2001, 86 (14) :3196-3199
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Optimal traffic networks [J].
Barthelemy, Marc ;
Flammini, Alessandro .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2006,
[5]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[6]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[7]   Navigating Ultrasmall Worlds in Ultrashort Time [J].
Boguna, Marian ;
Krioukov, Dmitri .
PHYSICAL REVIEW LETTERS, 2009, 102 (05)
[8]   Navigability of complex networks [J].
Boguna, Marian ;
Krioukov, Dmitri ;
Claffy, K. C. .
NATURE PHYSICS, 2009, 5 (01) :74-80
[9]   The economy of brain network organization [J].
Bullmore, Edward T. ;
Sporns, Olaf .
NATURE REVIEWS NEUROSCIENCE, 2012, 13 (05) :336-349
[10]   Learning paths in complex networks [J].
Cajueiro, D. O. ;
Andrade, R. F. S. .
EPL, 2009, 87 (05)