Likelihood-based approach to discriminate mixtures of network models that vary in time.

Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure, with a wealth of explanatory models based on these. These models are deliberately simple, commonly with the network growing according to a constant mechanism for its lifetime, to allow for analytical results. We use a likelihood-based framework on artificial data where the network model changes at a known point in time and demonstrate that we can recover the change point from analysis of the network. We then use real datasets and demonstrate how our framework can show the changing importance of network growth mechanisms over time.

Multilink communities of multiplex networks.

Multiplex networks describe a large number of complex social, biological and transportation networks where a set of nodes is connected by links of different nature and connotation. Here we uncover the rich community structure of multiplex networks by associating a community to each multilink where the multilinks characterize the connections existing between any two nodes of the multiplex network. Our community detection method reveals the rich interplay between the mesoscale structure of the multiplex networks and their multiplexity. For instance some nodes can belong to many layers and few communities while others can belong to few layers but many communities. Moreover the multilink communities can be formed by a different number of relevant layers. These results point out that mesoscopically there can be large differences in the compressibility of multiplex networks.

Anatomy of funded research in science.

Seeking research funding is an essential part of academic life. Funded projects are primarily collaborative in nature through internal and external partnerships, but what role does funding play in the formulation of these partnerships? Here, by examining over 43,000 scientific projects funded over the past three decades by one of the major government research agencies in the world, we characterize how the funding landscape has changed and its impacts on the underlying collaboration networks across different scales. We observed rising inequality in the distribution of funding and that its effect was most noticeable at the institutional level--the leading universities diversified their collaborations and increasingly became the knowledge brokers in the collaboration network. Furthermore, it emerged that these leading universities formed a rich club (i.e., a cohesive core through their close ties) and this reliance among them seemed to be a determining factor for their research success, with the elites in the core overattracting resources but also rewarding in terms of both research breadth and depth. Our results reveal how collaboration networks organize in response to external driving forces, which can have major ramifications on future research strategy and government policy.

Temporally correlated zero-range process with open boundaries: Steady state and fluctuations.

We study an open-boundary version of the on-off zero-range process introduced in Hirschberg et al. [Phys. Rev. Lett. 103, 090602 (2009)]. This model includes temporal correlations which can promote the condensation of particles, a situation observed in real-world dynamics. We derive the exact solution for the steady state of the one-site system, as well as a mean-field approximation for larger one-dimensional lattices, and also explore the large deviation properties of the particle current. Analytical and numerical calculations show that, although the particle distribution is well described by an effective Markovian solution, the probability of rare currents differs from the memoryless case. In particular, we find evidence for a memory-induced dynamical phase transition.

Rich-cores in networks.

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.

Weighted multiplex networks.

One of the most important challenges in network science is to quantify the information encoded in complex network structures. Disentangling randomness from organizational principles is even more demanding when networks have a multiplex nature. Multiplex networks are multilayer systems of [Formula: see text] nodes that can be linked in multiple interacting and co-evolving layers. In these networks, relevant information might not be captured if the single layers were analyzed separately. Here we demonstrate that such partial analysis of layers fails to capture significant correlations between weights and topology of complex multiplex networks. To this end, we study two weighted multiplex co-authorship and citation networks involving the authors included in the American Physical Society. We show that in these networks weights are strongly correlated with multiplex structure, and provide empirical evidence in favor of the advantage of studying weighted measures of multiplex networks, such as multistrength and the inverse multiparticipation ratio. Finally, we introduce a theoretical framework based on the entropy of multiplex ensembles to quantify the information stored in multiplex networks that would remain undetected if the single layers were analyzed in isolation.

Multiplex PageRank.

Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

Topological modelling of large networks.

In a complex network, there is a strong interaction between the network's topology and its functionality. A good topological network model is a practical tool as it can be used to test 'what-if' scenarios and it can provide predictions of the network's evolution. Modelling the topology structure of a large network is a challenging task, since there is no agreement in the research community on which properties of the network a model should be based, or how to test its accuracy. Here we present recent results on how to model a large network, the autonomous system (AS)-Internet, using a growth model. Based on a nonlinear preferential growth model and the reproduction of the network's rich club, the model reproduces many of the topological characteristics of the AS-Internet. We also identify a recent method to visualize the network's topology. This visualization technique is simple and fast and can be used to understand the properties of a large complex network or as a first step to validate a network model.

Accurately modeling the internet topology.

Based on measurements of the internet topology data, we found that there are two mechanisms which are necessary for the correct modeling of the internet topology at the autonomous systems (AS) level: the interactive growth of new nodes and new internal links, and a nonlinear preferential attachment, where the preference probability is described by a positive-feedback mechanism. Based on the above mechanisms, we introduce the positive-feedback preference (PFP) model which accurately reproduces many topological properties of the AS-level internet, including degree distribution, rich-club connectivity, the maximum degree, shortest path length, short cycles, disassortative mixing, and betweenness centrality. The PFP model is a phenomenological model which provides an insight into the evolutionary dynamics of real complex networks.