arXiv subjects

M. Tomassini

Publications and source records attributed to M. Tomassini.

6 recordsLinked to original sources

arXiv2015

Critical Cooperation Range to Improve Spatial Network Robustness

A robust worldwide air-transportation network (WAN) is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.

physics.soc-ph↗

arXiv2013

Smart Rewiring for Network Robustness

While new forms of attacks are developed every day to compromise essential infrastructures, service providers are also expected to develop strategies to mitigate the risk of extreme failures. In this context, tools of Network Science have been used to evaluate network robustness and propose resilient topologies against attacks. We present here a new rewiring method to modify the network topology improving its robustness, based on the evolution of the network largest component during a sequence of targeted attacks. In comparison to previous strategies, our method lowers by several orders of magnitude the computational effort necessary to improve robustness. Our rewiring also drives the formation of layers of nodes with similar degree while keeping a highly modular structure. This "modular onion-like structure" is a particular class of the onion-like structure previously described in the literature. We apply our rewiring strategy to an unweighted representation of the World Air Transportation network and show that an improvement of 30% in its overall robustness can be achieved through smart swaps of around 9% of its links.

physics.soc-ph↗

arXiv2007

Evolutionary Dilemmas in a Social Network

We simulate the prisoner's dilemma and hawk-dove games on a real social acquaintance network. Using a discrete analogue of replicator dynamics, we show that surprisingly high levels of cooperation can be achieved, contrary to what happens in unstructured mixing populations. Moreover, we empirically show that cooperation in this network is stable with respect to invasion by defectors.

physics.soc-ph↗

arXiv2007

The Genetic Programming Collaboration Network and its Communities

Useful information about scientific collaboration structures and patterns can be inferred from computer databases of published papers. The genetic programming bibliography is the most complete reference of papers on GP\@. In addition to locating publications, it contains coauthor and coeditor relationships from which a more complete picture of the field emerges. We treat these relationships as undirected small world graphs whose study reveals the community structure of the GP collaborative social network. Automatic analysis discovers new communities and highlights new facets of them. The investigation reveals many similarities between GP and coauthorship networks in other scientific fields but also some subtle differences such as a smaller central network component and a high clustering.

physics.soc-ph↗

arXiv2006

Hawks and Doves on Small-World Networks

We explore the Hawk-Dove game on networks with topologies ranging from regular lattices to random graphs with small-world networks in between. This is done by means of computer simulations using several update rules for the population evolutionary dynamics. We find the overall result that cooperation is sometimes inhibited and sometimes enhanced in those network structures, with respect to the mixing population case. The differences are due to different update rules and depend on the gain-to-cost ratio. We analyse and qualitatively explain this behavior by using local topological arguments.

physics.soc-ph↗

arXiv2006

Social Dilemmas and Cooperation in Complex Networks

In this paper we extend the investigation of cooperation in some classical evolutionary games on populations were the network of interactions among individuals is of the scale-free type. We show that the update rule, the payoff computation and, to some extent the timing of the operations, have a marked influence on the transient dynamics and on the amount of cooperation that can be established at equilibrium. We also study the dynamical behavior of the populations and their evolutionary stability.

physics.soc-ph↗