title: Exploring the morphospace of communication efficiency in complex networks.
abstract: 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.
authors.affiliation: Department of Psychological and Brain Sciences, Indiana University, Bloomington, Indiana, United States of America.
authors.forename: Joaquín
authors.initials: J
authors.lastname: Goñi
authors.forename: Andrea
authors.initials: A
authors.lastname: Avena-Koenigsberger
authors.forename: Nieves
authors.initials: N
authors.lastname: Velez de Mendizabal
authors.forename: Martijn P
authors.initials: MP
authors.lastname: van den Heuvel
authors.forename: Richard F
authors.initials: RF
authors.lastname: Betzel
authors.forename: Olaf
authors.initials: O
authors.lastname: Sporns
mesh_terms: D000465:Algorithms; D003142:Communication; D003198:Computer Simulation; D008962:Models, Theoretical