Adilson E. Motter

Cascade-based attacks on complex networks

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.

Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?

Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous distribution of connectivity are more synchronizable than heterogeneous ones, even though the average network distance is larger. We present numerical computations and analytical estimates on synchronizability of the network in terms of its heterogeneity parameters. Our results suggest that some degree of homogeneity is expected in naturally evolved structures, such as neural networks, where synchronizability is desirable.

Cascade control and defense in complex networks.

Complex networks with a heterogeneous distribution of loads may undergo a global cascade of overload failures when highly loaded nodes or edges are removed due to attacks or failures. Since a small attack or failure has the potential to trigger a global cascade, a fundamental question regards the possible strategies of defense to prevent the cascade from propagating through the entire network. Here we introduce and investigate a costless strategy of defense based on a selective further removal of nodes and edges, right after the initial attack or failure. This intentional removal of network elements is shown to drastically reduce the size of the cascade.

Network synchronization, diffusion, and the paradox of heterogeneity

Many complex networks display strong heterogeneity in the degree (connectivity) distribution. Heterogeneity in the degree distribution often reduces the average distance between nodes but, paradoxically, may suppress synchronization in networks of oscillators coupled symmetrically with uniform coupling strength. Here we offer a solution to this apparent paradox. Our analysis is partially based on the identification of a diffusive process underlying the communication between oscillators and reveals a striking relation between this process and the condition for the linear stability of the synchronized states. We show that, for a given degree distribution, the maximum synchronizability is achieved when the network of couplings is weighted and directed and the overall cost involved in the couplings is minimum. This enhanced synchronizability is solely determined by the mean degree and does not depend on the degree distribution and system size. Numerical verification of the main results is provided for representative classes of small-world and scale-free networks.

A Poissonian explanation for heavy tails in e-mail communication

Patterns of deliberate human activity and behavior are of utmost importance in areas as diverse as disease spread, resource allocation, and emergency response. Because of its widespread availability and use, e-mail correspondence provides an attractive proxy for studying human activity. Recently, it was reported that the probability density for the inter-event time τ between consecutively sent e-mails decays asymptotically as τ−α, with α ≈ 1. The slower-than-exponential decay of the inter-event time distribution suggests that deliberate human activity is inherently non-Poissonian. Here, we demonstrate that the approximate power-law scaling of the inter-event time distribution is a consequence of circadian and weekly cycles of human activity. We propose a cascading nonhomogeneous Poisson process that explicitly integrates these periodic patterns in activity with an individuals tendency to continue participating in an activity. Using standard statistical techniques, we show that our model is consistent with the empirical data. Our findings may also provide insight into the origins of heavy-tailed distributions in other complex systems.

Enhancing complex-network synchronization

Heterogeneity in the degree (connectivity) distribution has been shown to suppress synchronization in networks of symmetrically coupled oscillators with uniform coupling strength (unweighted coupling). Here we uncover a condition for enhanced synchronization in weighted networks with asymmetric coupling. We show that, in the optimum regime, synchronizability is solely determined by the average degree and does not depend on the system size and the details of the degree distribution. In scale-free networks, where the average degree may increase with heterogeneity, synchronizability is drastically enhanced and may become positively correlated with heterogeneity, while the overall cost involved in the network coupling is significantly reduced as compared to the case of unweighted coupling.

Topology of the conceptual network of language

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of languages, but also for cognitive science. We study this issue quantitatively, by mapping out the conceptual network of the English language, with the connections being defined by the entries in a Thesaurus dictionary. We find that this network presents a small-world structure, with an amazingly small average shortest path, and appears to exhibit an asymptotic scale-free feature with algebraic connectivity distribution.

Universality in the synchronization of weighted random networks

Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in the connection strengths. Here we study synchronization in weighted complex networks and show that the synchronizability of random networks with a large minimum degree is determined by two leading parameters: the mean degree and the heterogeneity of the distribution of nodes intensity, where the intensity of a node, defined as the total strength of input connections, is a natural combination of topology and weights. Our results provide a possibility for the control of synchronization in complex networks by the manipulation of a few parameters.

Realistic control of network dynamics

The control of complex networks is of paramount importance in areas as diverse as ecosystem management, emergency response and cell reprogramming. A fundamental property of networks is that perturbations to one node can affect other nodes, potentially causing the entire system to change behaviour or fail. Here we show that it is possible to exploit the same principle to control network behaviour. Our approach accounts for the nonlinear dynamics inherent to real systems, and allows bringing the system to a desired target state even when this state is not directly accessible due to constraints that limit the allowed interventions. Applications show that this framework permits reprogramming a network to a desired task, as well as rescuing networks from the brink of failure-which we illustrate through the mitigation of cascading failures in a power-grid network and the identification of potential drug targets in a signalling network of human cancer.

Synchronization is optimal in nondiagonalizable networks

We consider maximization of the synchronizability of oscillator networks by assigning weights and directions to the links of a given interaction topology. By extending the master stability formalism to all possible network structures, we show that, unless some oscillator is linked to all the others, maximally synchronizable networks are necessarily nondiagonalizable and can always be obtained by imposing unidirectional information flow with normalized input strengths. The results provide insights into hierarchical structures observed in complex networks in which synchronization is important.