The application of the network approach to the urban case poses several questions in terms of how to deal with metric distances, what kind of graph representation to use, what kind of measures to investigate, how to deepen the correlation between measures of the structure of the network and...

The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e., networks with power law P(k), are considered: (1)...

Large-scale blackouts are an intrinsic drawback of electric power transmission grids. Here we analyze the structural vulnerability of the Italian GRTN power grid by using a model for cascading failures recently proposed in Crucitti et al. (Phys. Rev. E 69 (2004)).

We study coauthorship networks based on the preprints submitted to the Los Alamos cond-mat database during the period 2000–2005. In our approach two scientists are considered connected if they have coauthored one or more cond-mat preprints together in the same year. We focus on the...

The 2010 eruption of the Eyjafjallajökull volcano had a devastating effect on the European air traffic network, preventing air travel throughout most of Europe for 6 days (Oroian in ProEnvironment 3:5–8, <CitationRef CitationID="CR17">2010</CitationRef>). The severity of the disruption was surprising as previous research suggests that...</citationref>

Inspired by the local minority game, we propose a network Boolean game and investigate its dynamical properties on scale-free networks. The system can self-organize to a stable state with better performance than the random choice game, although only the local information is available to each...

In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension. General networks with fractal or hierarchical...

We study the spatial prisoner’s dilemma game where the players are located on the nodes of a random scale-free network. The prisoner’s dilemma game is a powerful tool and has been used for the study of mutual trust and cooperation among individuals in structured populations. We vary the...

We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a complex network using the degree distribution and the...

In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of scale-free networks. Instead of using the information of degree and betweenness centrality, the new algorithm is derived on the basis of the expanding betweenness centrality of nodes, which gives an...