scholarly journals Influence of Interlink Topology on Multilayer Network Robustness

2020 ◽  
Vol 12 (3) ◽  
pp. 1202
Author(s):  
Fang Zhou ◽  
Xiang He ◽  
Yongbo Yuan ◽  
Mingyuan Zhang

Cascading failures between interdependent multilayer networks are being widely studied, especially the trend of robustness caused by the interlinks between networks. However, few researchers pay attention to the effect of the interlink topology on the robustness of coupled networks, which is a critical interlink factor of multilayer networks. In this study, the method frame of multilayer network experiment simulation is given. Through numerical simulation and actual network simulation, the exhaustive method is used to enumerate all the patterns of interlink topological relations of multilayer networks (three-layer or more). The research verifies that the interlink topology affects the global robustness and that there exists a fragile interlink pattern in the patterns of interlink topologies. The star-like interlink pattern with the most uneven interlink-degree distribution leads to the weakest robustness; the pattern with average interlink-degree distribution reveals good global stability as a loop-like pattern or entire interlink pattern. In addition, the influence of interlink topology is independent. The simulation results are not affected by the network layer number and intraparameters (including the network-generated form, each layer of network node number, and average degree of each layer of network). Thus, ignoring the interlink topology may result in the actual system suddenly becoming vulnerable before the theoretical calculation point. Interlink topology as an independent factor affecting the robustness of multilayer networks should be paid more attention.

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.


2017 ◽  
Vol 28 (04) ◽  
pp. 1750050 ◽  
Author(s):  
Yong Zhang ◽  
Lei Jin ◽  
Xiao Juan Wang

This paper is aimed at constructing robust multilayer networks against cascading failure. Considering link protection strategies in reality, we design a cascading failure model based on load distribution and extend it to multilayer. We use the cascading failure model to deduce the scale of the largest connected component after cascading failure, from which we can find that the performance of four kinds of load distribution strategies associates with the load ratio of the current edge to its adjacent edge. Coupling preference is a typical characteristic in multilayer networks which corresponds to the network robustness. The coupling preference of multilayer networks is divided into two forms: the coupling preference in layers and the coupling preference between layers. To analyze the relationship between the coupling preference and the multilayer network robustness, we design a construction algorithm to generate multilayer networks with different coupling preferences. Simulation results show that the load distribution based on the node betweenness performs the best. When the coupling coefficient in layers is zero, the scale-free network is the most robust. In the random network, the assortative coupling in layers is more robust than the disassortative coupling. For the coupling preference between layers, the assortative coupling between layers is more robust than the disassortative coupling both in the scale free network and the random network.


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.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Qing Cai ◽  
Mahardhika Pratama ◽  
Sameer Alam

Complex networks in reality may suffer from target attacks which can trigger the breakdown of the entire network. It is therefore pivotal to evaluate the extent to which a network could withstand perturbations. The research on network robustness has proven as a potent instrument towards that purpose. The last two decades have witnessed the enthusiasm on the studies of network robustness. However, existing studies on network robustness mainly focus on multilayer networks while little attention is paid to multipartite networks which are an indispensable part of complex networks. In this study, we investigate the robustness of multipartite networks under intentional node attacks. We develop two network models based on the largest connected component theory to depict the cascading failures on multipartite networks under target attacks. We then investigate the robustness of computer-generated multipartite networks with respect to eight node centrality metrics. We discover that the robustness of multipartite networks could display either discontinuous or continuous phase transitions. Interestingly, we discover that larger number of partite sets of a multipartite network could increase its robustness which is opposite to the phenomenon observed on multilayer networks. Our findings shed new lights on the robust structure design of complex systems. We finally present useful discussions on the applications of existing percolation theories that are well studied for network robustness analysis to multipartite networks. We show that existing percolation theories are not amenable to multipartite networks. Percolation on multipartite networks still deserves in-depth efforts.


2015 ◽  
Vol 92 (3) ◽  
Author(s):  
Xin Yuan ◽  
Shuai Shao ◽  
H. Eugene Stanley ◽  
Shlomo Havlin

2017 ◽  
Vol 20 (06n07) ◽  
pp. 1750015 ◽  
Author(s):  
HAI-BO HU ◽  
CANG-HAI LI ◽  
QING-YING MIAO

In this paper, to reveal the influence of multilayer network structure on opinion diffusion in social networks, we study an opinion dynamics model based on DeGroot model on multilayer networks. We find that if the influence matrix integrating the information of connectedness for each layer and correlation between layers is strongly connected and aperiodic, all agents’ opinions will reach a consensus. However, if there are stubborn agents in the networks, regular agents’ opinions will finally be confined to the convex combinations of the stubborn agents’. Specifically, if all stubborn agents hold the same opinion, even if the agents only exist on a certain layer, their opinions will diffuse to the entire multilayer networks. This paper not only characterizes the influence of multilayer network topology and agent attribute on opinion diffusion in a holistic way, but also demonstrates the importance of coupling agents which play an indispensable role in some social and economic situations.


2020 ◽  
Author(s):  
Michaël Pierrelée ◽  
Ana Reynders ◽  
Fabrice Lopez ◽  
Aziz Moqrich ◽  
Laurent Tichit ◽  
...  

Abstract Integrating -omics data with biological networks such as protein-protein interaction networks is a popular and useful approach to interpret expression changes of genes in changing conditions, and to identify relevant cellular pathways, active subnetworks or network communities. Yet, most -omics data integration tools are restricted to static networks and therefore cannot easily be used for analyzing time-series data. Determining regulations or exploring the network structure over time requires time-dependent networks which incorporate time as one component in their structure. Here, we present a method to project time-series data on sequential layers of a multilayer network, thus creating a temporal multilayer network (tMLN). We implemented this method as a Cytoscape app we named TimeNexus. TimeNexus allows to easily create, manage and visualize temporal multilayer networks starting from a combination of node and edge tables carrying the information on the temporal network structure. To allow further analysis of the tMLN, TimeNexus creates and passes on regular Cytoscape networks in form of static versions of the tMLN in three different ways: i) over the entire set of layers, ii) over two consecutive layers at a time, iii) or on one single layer at a time. We combined TimeNexus with the Cytoscape apps PathLinker and AnatApp/ANAT to extract active subnetworks from tMLNs. To test the usability of our app, we applied TimeNexus together with PathLinker or ANAT on temporal expression data of the yeast cell cycle and were able to identify active subnetworks relevant for different cell cycle phases. We furthermore used TimeNexus on our own temporal expression data from a mouse pain assay inducing hindpaw inflammation and detected active subnetworks relevant for an inflammatory response to injury, including immune response, cell stress response and regulation of apoptosis. TimeNexus is freely available from the Cytoscape app store at https://apps.cytoscape.org/apps/TimeNexus.


Author(s):  
Ginestra Bianconi

Epidemic processes are relevant to studying the propagation of infectious diseases, but their current use extends also to the study of propagation of ideas in the society or memes and news in online social media. In most of the relevant applications epidemic spreading does not actually take place on a single network but propagates in a multilayer network where different types of interaction play different roles. This chapter provides a comprehensive view of the effect that multilayer network structures have on epidemic processes. The Susceptible–Infected–Susceptible (SIS) Model and the Susceptible–Infected–Removed (SIR) Model are characterized on multilayer networks. Additionally, it is shown that the multilayer networks framework can also allow us to study interacting Awareness and epidemic spreading, competing networks and epidemics in temporal networks.


Sign in / Sign up

Export Citation Format

Share Document