“Big Data, Analytics Likely To Reshape Health Care Industry iHealthBeat Winston Hide -- associate professor of bioinformatics and computational biology at Harvard School of Public Health -- noted that privacy concerns are prevalent with the use of...”
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. Goñi J, Avena-Koenigsberger A, Velez de Mendizabal N, van den Heuvel MP, Betzel RF, et al. (2013) Exploring the Morphospace of Communication Efficiency in Complex Networks. PLoS ONE 8(3): e58070. http://dx.doi.org/10.1371/journal.pone.0058070
I. Carolina Martínez's insight:
@mamanzana vi este artículo, no se sí ya lo tienes, pero te puede interesar
Ronaldo Menezes, "Complex Networks (Studies in Computational Intelligence)" English | ISBN: 3642302866 | 2013 | 216 pages | PDF | 19 MB In the last (New Post : Complex Networks (Studies in Computational Intelligence)
Abstract: Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.
Rule 1: For Every Result, Keep Track of How It Was Produced Rule 2: Avoid Manual Data Manipulation Steps Rule 3: Archive the Exact Versions of All External Programs Used Rule 4: Version Control All Custom Scripts Rule 5: Record All Intermediate Results, When Possible in Standardized Formats Rule 6: For Analyses That Include Randomness, Note Underlying Random Seeds Rule 7: Always Store Raw Data behind Plots Rule 8: Generate Hierarchical Analysis Output, Allowing Layers of Increasing Detail to Be Inspected Rule 9: Connect Textual Statements to Underlying Results Rule 10: Provide Public Access to Scripts, Runs, and Results