The diplomat's dilemma: Maximal power for minimal effort in social networks

Closeness is a global measure of centrality in networks, and a proxy for how influential actors are in social networks. In most network models, and many empirical networks, closeness is strongly correlated with degree. However, in social networks there is a cost of maintaining social ties. This leads to a situation (that can occur in the professional social networks of executives, lobbyists, diplomats and so on) where agents have the conflicting objectives of aiming for centrality while simultaneously keeping the degree low. We investigate this situation in an adaptive network-evolution model where agents optimize their positions in the network following individual strategies, and using only local information. The strategies are also optimized, based on the success of the agent and its neighbors. We measure and describe the time evolution of the network and the agents' strategies.Comment: Submitted to Adaptive Networks: Theory, Models and Applications, to be published from Springe

Multitask Learning on Graph Neural Networks: Learning Multiple Graph Centrality Measures with a Unified Network

The application of deep learning to symbolic domains remains an active research endeavour. Graph neural networks (GNN), consisting of trained neural modules which can be arranged in different topologies at run time, are sound alternatives to tackle relational problems which lend themselves to graph representations. In this paper, we show that GNNs are capable of multitask learning, which can be naturally enforced by training the model to refine a single set of multidimensional embeddings $\in \mathbb{R}^d$ and decode them into multiple outputs by connecting MLPs at the end of the pipeline. We demonstrate the multitask learning capability of the model in the relevant relational problem of estimating network centrality measures, focusing primarily on producing rankings based on these measures, i.e. is vertex $v_1$ more central than vertex $v_2$ given centrality $c$?. We then show that a GNN can be trained to develop a \emph{lingua franca} of vertex embeddings from which all relevant information about any of the trained centrality measures can be decoded. The proposed model achieves $89\%$ accuracy on a test dataset of random instances with up to 128 vertices and is shown to generalise to larger problem sizes. The model is also shown to obtain reasonable accuracy on a dataset of real world instances with up to 4k vertices, vastly surpassing the sizes of the largest instances with which the model was trained ($n=128$). Finally, we believe that our contributions attest to the potential of GNNs in symbolic domains in general and in relational learning in particular.Comment: Published at ICANN2019. 10 pages, 3 Figure

Exploring concurrency and reachability in the presence of high temporal resolution

Network properties govern the rate and extent of spreading processes on networks, from simple contagions to complex cascades. Recent advances have extended the study of spreading processes from static networks to temporal networks, where nodes and links appear and disappear. We review previous studies on the effects of temporal connectivity for understanding the spreading rate and outbreak size of model infection processes. We focus on the effects of "accessibility", whether there is a temporally consistent path from one node to another, and "reachability", the density of the corresponding "accessibility graph" representation of the temporal network. We study reachability in terms of the overall level of temporal concurrency between edges, quantifying the overlap of edges in time. We explore the role of temporal resolution of contacts by calculating reachability with the full temporal information as well as with a simplified interval representation approximation that demands less computation. We demonstrate the extent to which the computed reachability changes due to this simplified interval representation.Comment: To appear in Holme and Saramaki (Editors). "Temporal Network Theory". Springer- Nature, New York. 201

Functional cartography of complex metabolic networks

High-throughput techniques are leading to an explosive growth in the size of biological databases and creating the opportunity to revolutionize our understanding of life and disease. Interpretation of these data remains, however, a major scientific challenge. Here, we propose a methodology that enables us to extract and display information contained in complex networks. Specifically, we demonstrate that one can (i) find functional modules in complex networks, and (ii) classify nodes into universal roles according to their pattern of intra- and inter-module connections. The method thus yields a ``cartographic representation'' of complex networks. Metabolic networks are among the most challenging biological networks and, arguably, the ones with more potential for immediate applicability. We use our method to analyze the metabolic networks of twelve organisms from three different super-kingdoms. We find that, typically, 80% of the nodes are only connected to other nodes within their respective modules, and that nodes with different roles are affected by different evolutionary constraints and pressures. Remarkably, we find that low-degree metabolites that connect different modules are more conserved than hubs whose links are mostly within a single module.Comment: 17 pages, 4 figures. Go to http://amaral.northwestern.edu for the PDF file of the reprin

Graph Metrics for Temporal Networks

Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causality. In this chapter we discuss how to represent temporal networks and we review the definitions of walks, paths, connectedness and connected components valid for graphs in which the links fluctuate over time. We then focus on temporal node-node distance, and we discuss how to characterise link persistence and the temporal small-world behaviour in this class of networks. Finally, we discuss the extension of classic centrality measures, including closeness, betweenness and spectral centrality, to the case of time-varying graphs, and we review the work on temporal motifs analysis and the definition of modularity for temporal graphs.Comment: 26 pages, 5 figures, Chapter in Temporal Networks (Petter Holme and Jari Saram\"aki editors). Springer. Berlin, Heidelberg 201

UK experience of liver transplantation for erythropoietic protoporphyria

Erythropoietic protoporphyria (EPP) is characterised by excess production of free protoporphyrin from the bone marrow, most commonly due to deficiency of the enzyme ferrochelatase. Excess protoporphyrin gives rise to the cutaneous photosensitivity characteristic of the disease, and in a minority of patients leads to end-stage liver disease necessitating liver transplantation (LT). There is limited information regarding the timing, impact and long-term outcome of LT in such patients, thus we aimed to identify the indications and outcomes of all transplants performed for EPP in the UK using data from the UK Transplant Registry. Between 1987 and 2009, five patients underwent LT for EPP liver disease. Median follow-up was 60 months, and there were two deaths at 44 and 95 months from causes unrelated to liver disease. The remaining recipients are alive at 22.4 years, 61 months and 55 months after transplant. A high rate of postoperative biliary stricturing requiring multiple biliary interventions was observed. Recurrent EPP-liver disease occurred in 4/5 (80%) of patients but graft failure has not been observed. Given the role of biliary obstruction in inducing EPP-mediated liver damage, we suggest that consideration should be given for construction of a Roux loop at the time of transplant. Thus we demonstrate that although EPP liver transplant recipients have a good long-term survival, comparable to patients undergoing LT for other indications, biliary complications and disease recurrence are almost universal, and bone marrow transplantation should be considered where possible

Structural efficiency of percolation landscapes in flow networks

Complex networks characterized by global transport processes rely on the presence of directed paths from input to output nodes and edges, which organize in characteristic linked components. The analysis of such network-spanning structures in the framework of percolation theory, and in particular the key role of edge interfaces bridging the communication between core and periphery, allow us to shed light on the structural properties of real and theoretical flow networks, and to define criteria and quantities to characterize their efficiency at the interplay between structure and functionality. In particular, it is possible to assess that an optimal flow network should look like a "hairy ball", so to minimize bottleneck effects and the sensitivity to failures. Moreover, the thorough analysis of two real networks, the Internet customer-provider set of relationships at the autonomous system level and the nervous system of the worm Caenorhabditis elegans --that have been shaped by very different dynamics and in very different time-scales--, reveals that whereas biological evolution has selected a structure close to the optimal layout, market competition does not necessarily tend toward the most customer efficient architecture.Comment: 8 pages, 5 figure

Learning and innovative elements of strategy adoption rules expand cooperative network topologies

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoners Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.Comment: 14 pages, 3 Figures + a Supplementary Material with 25 pages, 3 Tables, 12 Figures and 116 reference

The origin of large molecules in primordial autocatalytic reaction networks

Large molecules such as proteins and nucleic acids are crucial for life, yet their primordial origin remains a major puzzle. The production of large molecules, as we know it today, requires good catalysts, and the only good catalysts we know that can accomplish this task consist of large molecules. Thus the origin of large molecules is a chicken and egg problem in chemistry. Here we present a mechanism, based on autocatalytic sets (ACSs), that is a possible solution to this problem. We discuss a mathematical model describing the population dynamics of molecules in a stylized but prebiotically plausible chemistry. Large molecules can be produced in this chemistry by the coalescing of smaller ones, with the smallest molecules, the `food set', being buffered. Some of the reactions can be catalyzed by molecules within the chemistry with varying catalytic strengths. Normally the concentrations of large molecules in such a scenario are very small, diminishing exponentially with their size. ACSs, if present in the catalytic network, can focus the resources of the system into a sparse set of molecules. ACSs can produce a bistability in the population dynamics and, in particular, steady states wherein the ACS molecules dominate the population. However to reach these steady states from initial conditions that contain only the food set typically requires very large catalytic strengths, growing exponentially with the size of the catalyst molecule. We present a solution to this problem by studying `nested ACSs', a structure in which a small ACS is connected to a larger one and reinforces it. We show that when the network contains a cascade of nested ACSs with the catalytic strengths of molecules increasing gradually with their size (e.g., as a power law), a sparse subset of molecules including some very large molecules can come to dominate the system.Comment: 49 pages, 17 figures including supporting informatio

Composition and Structure of a Large Online Social Network in the Netherlands

Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in the Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for the Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities