Link prediction for multilayer networks using interlayer structural information

Author(s):  
Fengqin Tang ◽  
Chunning Wang ◽  
Yuanyuan Wang ◽  
Jinxia Su

A multilayer network is a useful representation for real-world complex systems in which multiple types of connections are formed between entities. Connections of the same type form a specific layer of the network. We propose a novel framework for predicting links in a target layer of a multilayer network by taking into account the interlayer structural information. The method depends on the intuitive assumption that two node pairs in the target layer tend to have similar connection patterns if these pairs of nodes are similar. Further, the prediction accuracy will be improved in the target layer if the structural information of the copies of the node pairs in relevant layers is employed. We demonstrate the effectiveness of the proposed method experimentally by applying it to both simulated and real-world multilayer networks.

Author(s):  
Ginestra Bianconi

Chapter 1 constitutes Part I of the book: ‘Single and Multilayer Networks’. This chapter introduces multilayer networks as an important new development of Network Science that allows a more comprehensive understanding of Complex Systems. It identifies the main motivations driving the research activity in this field of multilayer networks and emphasizes the benefits of taking a multilayer network perpective to characterize network data. The main advantages of a multilayer network approach with respect to the more traditional single layer characterization of complex networks are broadly discussed, focusing on the information gain resulting from the analysis of multilayer networks, the non-reducibility of a multilayer network to a large single network and the rich interplay between structure and function in multilayer networks.


Author(s):  
Ginestra Bianconi

This chapter characterizes interdependent multilayer networks and their increased fragility. Interdependent networks are stylized models that can represent different complex systems, ranging from global infrastructures to molecular networks in the cell. When a fraction of nodes is initially damaged, interdependent networks are affected by dramatic cascades of failures that suddenly dismantle the multilayer network. The theory beyond this phenomenology is discussed in a pedagogical way by characterizing the percolation, discontinuous and hybrid transitions. The interplay between structure and function is studied in this context by considering multiplex networks without and with link overlap, and the effect of built-in correlations in the multilayer network structure. Finally, partial interdependencies and redundant interdependencies are discussed as major strategies to reduce the fragility of interdependent networks.


2018 ◽  
Vol 29 (06) ◽  
pp. 1850051
Author(s):  
Xiao Chen ◽  
Zhe-Ming Lu

Many real-world complex systems consist of a set of basic units that are connected by different kinds of relationships. All types of such systems can be described by a multilayer network, where each link represents different types of interaction among the same set of nodes. In this paper, we present a general framework to characterize the influences (centrality) of layers. Furthermore, we propose two measures for layer centrality in terms of network connectivity under this framework. The basic idea of our measures consists in assigning more centrality value to layers that contribute more connectivity in a multilayer network. In other words, layers are more influential if more centrality values of links are assigned to them. We validate the measures on a real-world dataset of air transportation multilayer network and find that the measures are able to extract novel and useful information from the dataset.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Hyobin Kim ◽  
Omar K. Pineda ◽  
Carlos Gershenson

Antifragility is a property from which systems are able to resist stress and furthermore benefit from it. Even though antifragile dynamics is found in various real-world complex systems where multiple subsystems interact with each other, the attribute has not been quantitatively explored yet in those complex systems which can be regarded as multilayer networks. Here we study how the multilayer structure affects the antifragility of the whole system. By comparing single-layer and multilayer Boolean networks based on our recently proposed antifragility measure, we found that the multilayer structure facilitated the production of antifragile systems. Our measure and findings will be useful for various applications such as exploring properties of biological systems with multilayer structures and creating more antifragile engineered systems.


Author(s):  
Ginestra Bianconi

This chapter addresses diffusion, random walks and congestion in multilayer networks. Here it is revealed that diffusion on a multilayer network can be significantly speed up with respect to diffusion taking place on its single layers taken in isolation, and that sometimes it is possible also to observe super-diffusion. Diffusion is here characterized on multilayer network structures by studying the spectral properties of the supra-Laplacian and the dependence on the diffusion constant among different layers. Random walks and its variations including the Lévy Walk are shown to reflect the improved navigability of multilayer networks with more layers. These results are here compared with the results of traffic on multilayer networks that, on the contrary, point out that increasing the number of layers could be detrimental and could lead to congestion.


Author(s):  
Ginestra Bianconi

Defining the centrality of nodes and layers in multilayer networks is of fundamental importance for a variety of applications from sociology to biology and finance. This chapter presents the state-of-the-art centrality measures able to characterize the centrality of nodes, the influences of layers or the centrality of replica nodes in multilayer and multiplex networks. These centrality measures include modifications of the eigenvector centrality, Katz centrality, PageRank centrality and Communicability to the multilayer network scenario. The chapter provides a comprehensive description of the research of the field and discusses the main advantages and limitations of the different definitions, allowing the readers that wish to apply these techniques to choose the most suitable definition for his or her case study.


Author(s):  
Stefan Thurner ◽  
Rudolf Hanel ◽  
Peter Klimekl

Understanding the interactions between the components of a system is key to understanding it. In complex systems, interactions are usually not uniform, not isotropic and not homogeneous: each interaction can be specific between elements.Networks are a tool for keeping track of who is interacting with whom, at what strength, when, and in what way. Networks are essential for understanding of the co-evolution and phase diagrams of complex systems. Here we provide a self-contained introduction to the field of network science. We introduce ways of representing and handle networks mathematically and introduce the basic vocabulary and definitions. The notions of random- and complex networks are reviewed as well as the notions of small world networks, simple preferentially grown networks, community detection, and generalized multilayer networks.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Qing Yao ◽  
Bingsheng Chen ◽  
Tim S. Evans ◽  
Kim Christensen

AbstractWe study the evolution of networks through ‘triplets’—three-node graphlets. We develop a method to compute a transition matrix to describe the evolution of triplets in temporal networks. To identify the importance of higher-order interactions in the evolution of networks, we compare both artificial and real-world data to a model based on pairwise interactions only. The significant differences between the computed matrix and the calculated matrix from the fitted parameters demonstrate that non-pairwise interactions exist for various real-world systems in space and time, such as our data sets. Furthermore, this also reveals that different patterns of higher-order interaction are involved in different real-world situations. To test our approach, we then use these transition matrices as the basis of a link prediction algorithm. We investigate our algorithm’s performance on four temporal networks, comparing our approach against ten other link prediction methods. Our results show that higher-order interactions in both space and time play a crucial role in the evolution of networks as we find our method, along with two other methods based on non-local interactions, give the best overall performance. The results also confirm the concept that the higher-order interaction patterns, i.e., triplet dynamics, can help us understand and predict the evolution of different real-world systems.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Ghislain Romaric Meleu ◽  
Paulin Yonta Melatagia

AbstractUsing the headers of scientific papers, we have built multilayer networks of entities involved in research namely: authors, laboratories, and institutions. We have analyzed some properties of such networks built from data extracted from the HAL archives and found that the network at each layer is a small-world network with power law distribution. In order to simulate such co-publication network, we propose a multilayer network generation model based on the formation of cliques at each layer and the affiliation of each new node to the higher layers. The clique is built from new and existing nodes selected using preferential attachment. We also show that, the degree distribution of generated layers follows a power law. From the simulations of our model, we show that the generated multilayer networks reproduce the studied properties of co-publication networks.


2021 ◽  
Vol 11 (11) ◽  
pp. 5043
Author(s):  
Xi Chen ◽  
Bo Kang ◽  
Jefrey Lijffijt ◽  
Tijl De Bie

Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, the prediction of protein–protein interactions, and the identification of hidden relationships in a crime network. Several link prediction algorithms, notably those recently introduced using network embedding, are capable of doing this by just relying on the observed part of the network. Often, whether two nodes are linked can be queried, albeit at a substantial cost (e.g., by questionnaires, wet lab experiments, or undercover work). Such additional information can improve the link prediction accuracy, but owing to the cost, the queries must be made with due consideration. Thus, we argue that an active learning approach is of great potential interest and developed ALPINE (Active Link Prediction usIng Network Embedding), a framework that identifies the most useful link status by estimating the improvement in link prediction accuracy to be gained by querying it. We proposed several query strategies for use in combination with ALPINE, inspired by the optimal experimental design and active learning literature. Experimental results on real data not only showed that ALPINE was scalable and boosted link prediction accuracy with far fewer queries, but also shed light on the relative merits of the strategies, providing actionable guidance for practitioners.


Sign in / Sign up

Export Citation Format

Share Document