Robustness of complex networks to node and cluster damage

Copyright @ 2009 Universtiy of WarwickThe goal of this investigation is to assess the robustness of two popular network structures – random networks and scale-free networks – to node and cluster damage. There is no previous work on the latter. For node damage, we remove nodes iteratively and for cluster damage, we first build a network of clusters and then remove the nodes (clusters)

Transition from the self-organized to the driven dynamical clusters

We study the mechanism of formation of synchronized clusters in coupled maps on networks with various connection architectures. The nodes in a cluster are self- synchronized or driven-synchronized, based on the coupling strength and underlying network structures. A smaller coupling strength region shows driven clusters independent of the network rewiring strategies, whereas a larger coupling strength region shows the transition from the self-organized cluster to the driven cluster as network connections are rewired to the bi-partite type. Lyapunov function analysis is performed to understand the dynamical origin of cluster formation. The results provide insights into the relationship between the topological clusters which are based on the direct connections between the nodes, and the dynamical clusters which are based on the functional behavior of these nodes.Comment: 18 pages, 7 figure

Network constraints on learnability of probabilistic motor sequences

Human learners are adept at grasping the complex relationships underlying incoming sequential input. In the present work, we formalize complex relationships as graph structures derived from temporal associations in motor sequences. Next, we explore the extent to which learners are sensitive to key variations in the topological properties inherent to those graph structures. Participants performed a probabilistic motor sequence task in which the order of button presses was determined by the traversal of graphs with modular, lattice-like, or random organization. Graph nodes each represented a unique button press and edges represented a transition between button presses. Results indicate that learning, indexed here by participants' response times, was strongly mediated by the graph's meso-scale organization, with modular graphs being associated with shorter response times than random and lattice graphs. Moreover, variations in a node's number of connections (degree) and a node's role in mediating long-distance communication (betweenness centrality) impacted graph learning, even after accounting for level of practice on that node. These results demonstrate that the graph architecture underlying temporal sequences of stimuli fundamentally constrains learning, and moreover that tools from network science provide a valuable framework for assessing how learners encode complex, temporally structured information.Comment: 29 pages, 4 figure

Mining a medieval social network by kernel SOM and related methods

This paper briefly presents several ways to understand the organization of a large social network (several hundreds of persons). We compare approaches coming from data mining for clustering the vertices of a graph (spectral clustering, self-organizing algorithms. . .) and provide methods for representing the graph from these analysis. All these methods are illustrated on a medieval social network and the way they can help to understand its organization is underlined

Business networks SMEs and inter-firm collaboration: a review of the research literature with implications for policy

This literature review, which was commissioned by the UK's Small Business Service is concerned with business networks, and their importance for the small business community. Business networks are sometimes defined as comprising only inter-firm relationships (e.g. those that exist between component supplier and a manufacturer). However, it soon becomes apparent that a broader perspective is required, if research findings are to contribute meaningful insights for policy and practice. We have therefore incorporated research evidence on personal networks, notably those associated with entrepreneurship, and on links between firms and supporting institutions, such as trade associations, government agencies and universities

Core-periphery organization of complex networks

Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. For example do geographical networks have a strong core-periphery structure, while the core-periphery structure of social networks (despite their positive degree-degree correlations) is rather weak. We proceed to study radial statistics of the core, i.e. properties of the n-neighborhoods of the core vertices for increasing n. We find that almost all networks have unexpectedly many edges within n-neighborhoods at a certain distance from the core suggesting an effective radius for non-trivial network processes

Extracting the hierarchical organization of complex systems

Extracting understanding from the growing ``sea'' of biological and socio-economic data is one of the most pressing scientific challenges facing us. Here, we introduce and validate an unsupervised method that is able to accurately extract the hierarchical organization of complex biological, social, and technological networks. We define an ensemble of hierarchically nested random graphs, which we use to validate the method. We then apply our method to real-world networks, including the air-transportation network, an electronic circuit, an email exchange network, and metabolic networks. We find that our method enables us to obtain an accurate multi-scale descriptions of a complex system.Comment: Figures in screen resolution. Version with full resolution figures available at http://amaral.chem-eng.northwestern.edu/Publications/Papers/sales-pardo-2007.pd