Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How and at which cost can one restructure the network such that it will become more robust against a malicious attack? We introduce a new measure for robustness and use it to devise a method to mitigate economically and efficiently this risk. We demonstrate its efficiency on the European electricity system and on the Internet as well as on complex networks models. We show that with small changes in the network structure (low cost) the robustness of diverse networks can be improved dramatically whereas their functionality remains unchanged. Our results are useful not only for improving significantly with low cost the robustness of existing infrastructures but also for designing economically robust network systems.

A number of predictors have been suggested to detect the most influential spreaders of information in online social media across various domains such as Twitter or Facebook. In particular, degree, PageRank, k-core and other centralities have been adopted to rank the spreading capability of users in information dissemination media. So far, validation of the proposed predictors has been done by simulating the spreading dynamics rather than following real information flow in social networks. Consequently, only model-dependent contradictory results have been achieved so far for the best predictor. Here, we address this issue directly. We search for influential spreaders by following the real spreading dynamics in a wide range of networks. We find that the widely-used degree and PageRank fail in ranking users' influence. We find that the best spreaders are consistently located in the k-core across dissimilar social platforms such as Twitter, Facebook, Livejournal and scientific publishing in the American Physical Society. Furthermore, when the complete global network structure is unavailable, we find that the sum of the nearest neighbors' degree is a reliable local proxy for user's influence. Our analysis provides practical instructions for optimal design of strategies for “viral” information dissemination in relevant applications.

An important issue in the study of cities is defining a metropolitan area, because different definitions affect conclusions regarding the statistical distribution of urban activity. A commonly employed method of defining a metropolitan area is the Metropolitan Statistical Areas (MSAs), based on rules attempting to capture the notion of city as a functional economic region, and it is performed by using experience. The construction of MSAs is a time-consuming process and is typically done only for a subset (a few hundreds) of the most highly populated cities. Here, we introduce a method to designate metropolitan areas, denoted “City Clustering Algorithm” (CCA). The CCA is based on spatial distributions of the population at a fine geographic scale, defining a city beyond the scope of its administrative boundaries. We use the CCA to examine Gibrat's law of proportional growth, which postulates that the mean and standard deviation of the growth rate of cities are constant, independent of city size. We find that the mean growth rate of a cluster by utilizing the CCA exhibits deviations from Gibrat's law, and that the standard deviation decreases as a power law with respect to the city size. The CCA allows for the study of the underlying process leading to these deviations, which are shown to arise from the existence of long-range spatial correlations in population growth. These results have sociopolitical implications, for example, for the location of new economic development in cities of varied size.

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small-world, Euclidean, space filling, and with matching graphs. These networks describe force chains in polydisperse granular packings and could also be applied to the geometry of fully fragmented porous media, hierarchical road systems, and area-covering electrical supply networks. Some of the properties of these networks, namely, the connectivity exponent, the clustering coefficient, and the shortest path are calculated and found to be particularly rich. The percolation, the electrical conduction, and the Ising models on such networks are also studied and found to be quite peculiar. Consequences for applications are also discussed.

Connecting complex networks is known to exacerbate perturbations and lead to cascading failures, but natural networks of networks are surprisingly stable. A theory now proposes that network structure holds the key to understanding this paradox. Networks in nature do not act in isolation, but instead exchange information and depend on one another to function properly1,2,3. Theory has shown that connecting random networks may very easily result in abrupt failures3,4,5,6. This finding reveals an intriguing paradox7,8: if natural systems organize in interconnected networks, how can they be so stable? Here we provide a solution to this conundrum, showing that the stability of a system of networks relies on the relation between the internal structure of a network and its pattern of connections to other networks. Specifically, we demonstrate that if interconnections are provided by network hubs, and the connections between networks are moderately convergent, the system of networks is stable and robust to failure. We test this theoretical prediction on two independent experiments of functional brain networks (in task and resting states), which show that brain networks are connected with a topology that maximizes stability according to the theory.

We propose and test a model that describes the morphology of cities, the scaling of the urban perimeter of individual cities, and the area distribution of systems of cities. The model is also consistent with observable urban growth dynamics, our results agreeing both qualitatively and quantitatively with urban data. The resulting growth morphology can be understood from interactions among the constituent units forming an urban region, and can be modeled using a correlated percolation model in the presence of a gradient.