Comparison of Opinion Polarization on Single-Layer and Multiplex Networks

Author(s):  
Sonoko Kimura ◽  
Kimitaka Asatani ◽  
Toshiharu Sugawara
2017 ◽  
Vol 28 (08) ◽  
pp. 1750101 ◽  
Author(s):  
Yabing Yao ◽  
Ruisheng Zhang ◽  
Fan Yang ◽  
Yongna Yuan ◽  
Qingshuang Sun ◽  
...  

In complex networks, the existing link prediction methods primarily focus on the internal structural information derived from single-layer networks. However, the role of interlayer information is hardly recognized in multiplex networks, which provide more diverse structural features than single-layer networks. Actually, the structural properties and functions of one layer can affect that of other layers in multiplex networks. In this paper, the effect of interlayer structural properties on the link prediction performance is investigated in multiplex networks. By utilizing the intralayer and interlayer information, we propose a novel “Node Similarity Index” based on “Layer Relevance” (NSILR) of multiplex network for link prediction. The performance of NSILR index is validated on each layer of seven multiplex networks in real-world systems. Experimental results show that the NSILR index can significantly improve the prediction performance compared with the traditional methods, which only consider the intralayer information. Furthermore, the more relevant the layers are, the higher the performance is enhanced.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Nicolò Musmeci ◽  
Vincenzo Nicosia ◽  
Tomaso Aste ◽  
Tiziana Di Matteo ◽  
Vito Latora

We propose here a multiplex network approach to investigate simultaneously different types of dependency in complex datasets. In particular, we consider multiplex networks made of four layers corresponding, respectively, to linear, nonlinear, tail, and partial correlations among a set of financial time series. We construct the sparse graph on each layer using a standard network filtering procedure, and we then analyse the structural properties of the obtained multiplex networks. The study of the time evolution of the multiplex constructed from financial data uncovers important changes in intrinsically multiplex properties of the network, and such changes are associated with periods of financial stress. We observe that some features are unique to the multiplex structure and would not be visible otherwise by the separate analysis of the single-layer networks corresponding to each dependency measure.


2020 ◽  
Vol 7 (7) ◽  
pp. 191928
Author(s):  
Amir Mahdi Abdolhosseini-Qomi ◽  
Seyed Hossein Jafari ◽  
Amirheckmat Taghizadeh ◽  
Naser Yazdani ◽  
Masoud Asadpour ◽  
...  

Networks are invaluable tools to study real biological, social and technological complex systems in which connected elements form a purposeful phenomenon. A higher resolution image of these systems shows that the connection types do not confine to one but to a variety of types. Multiplex networks encode this complexity with a set of nodes which are connected in different layers via different types of links. A large body of research on link prediction problem is devoted to finding missing links in single-layer (simplex) networks. In recent years, the problem of link prediction in multiplex networks has gained the attention of researchers from different scientific communities. Although most of these studies suggest that prediction performance can be enhanced by using the information contained in different layers of the network, the exact source of this enhancement remains obscure. Here, it is shown that similarity w.r.t. structural features (eigenvectors) is a major source of enhancements for link prediction task in multiplex networks using the proposed layer reconstruction method and experiments on real-world multiplex networks from different disciplines. Moreover, we characterize how low values of similarity w.r.t. structural features result in cases where improving prediction performance is substantially hard.


2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Seyedsaeed Hajiseyedjavadi ◽  
Yu-Ru Lin ◽  
Konstantinos Pelechrinis

AbstractLearning low-dimensional representations of graphs has facilitated the use of traditional machine learning techniques to solving classic network analysis tasks such as link prediction, node classification, community detection, etc. However, to date, the vast majority of these learning tasks are focused on traditional single-layer/unimodal networks and largely ignore the case of multiplex networks. A multiplex network is a suitable structure to model multi-dimensional real-world complex systems. It consists of multiple layers where each layer represents a different relationship among the network nodes. In this work, we propose MUNEM, a novel approach for learning a low-dimensional representation of a multiplex network using a triplet loss objective function. In our approach, we preserve the global structure of each layer, while at the same time fusing knowledge among different layers during the learning process. We evaluate the effectiveness of our proposed method by testing and comparing on real-world multiplex networks from different domains, such as collaboration network, protein-protein interaction network, online social network. Finally, in order to deliberately examine the effect of our model’s parameters we conduct extensive experiments on synthetic multiplex networks.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Shouwei Li ◽  
Shihang Wen

We investigate a multiplex network of the guarantee market with three layers corresponding to different types of guarantee relationships in China. We find that three single-layer networks all have the scale-free property and are of disassortative nature. A single-layer network is not quite representative of another single-layer network. The result of the betweenness centrality shows that central companies in one layer are not necessarily central in another layer. And the eigenvector centrality has the same result of the betweenness centrality except the top central company.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Edwin Montes-Orozco ◽  
Roman-Anselmo Mora-Gutiérrez ◽  
Bibiana Obregón-Quintana ◽  
Sergio-G. de-los-Cobos-Silva ◽  
Eric A. Rincón-García ◽  
...  

Inverse percolation is known as the problem of finding the minimum set of nodes whose elimination of their links causes the rupture of the network. Inverse percolation has been widely used in various studies of single-layer networks. However, the use and generalization of multiplex networks have been little considered. In this work, we propose a methodology based on inverse percolation to quantify the robustness of multiplex networks. Specifically, we present a modified version of the mathematical model for the multiplex-vertex separator problem (m-VSP). By solving the m-VSP, we can find nodes that cause the rupture of the mutually connected giant component (MCGC) and the large viable cluster (LVC) when their links are removed from the network. The methodology presented in this work was tested in a set of benchmark networks, and as case study, we present an analysis using a set of multiplex social networks modeled with information about the main characteristics of the best universities in the world and the universities in Mexico. The results show that the methodology presented in this work can work in different models and types of 2- and 3-layer multiplex networks without dividing the entire multiplex network into single-layer as some techniques described in the specific literature. Furthermore, thanks to the fact that the technique does not require the calculation of some structural measure or centrality metric, and it is easy to scale for networks of different sizes.


2018 ◽  
Vol 6 (2) ◽  
pp. 157-175 ◽  
Author(s):  
PAUL E. SMALDINO ◽  
RAISSA M. D'SOUZA ◽  
ZEEV MAOZ

AbstractWe examine a model of network formation in single-layer and multiplex networks in which individuals have positive incentives for social ties, closed triangles, and spillover edges. In particular, we investigate the influence of shocks to the network in which the cost of social ties changes after an initial equilibrium. We highlight the emergence of structural entrenchment: the retention of structural features, such as closed triangles and spillover edges, which are formed under historically different conditions from those currently driving network evolution. This work has broad implications for understanding path dependence in the structure and dynamics of single-layer and multiplex networks.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Nianwen Ning ◽  
Feiyu Long ◽  
Chunchun Wang ◽  
Youjie Zhang ◽  
Yilin Yang ◽  
...  

Many real-world complex systems have multiple types of relations between their components, and they are popularly modeled as multiplex networks with each type of relation as one layer. Since the fusion analysis of multiplex networks can provide a comprehensive insight, the structural information fusion of multiplex networks has become a crucial issue. However, most of these existing data fusion methods are inappropriate for researchers to apply to complex network analysis directly. The feature-based fusion methods ignore the sharing and complementarity of interlayer structural information. To tackle this problem, we propose a multiplex network structural fusion (MNSF) model, which can construct a network with comprehensive information. It is composed of two modules: the network feature extraction (NFE) module and the network structural fusion (NSF) module. (1) In NFE, MNSF first extracts a low-dimensional vector representation of a node from each layer. Then, we construct a node similarity network based on embedding matrices and K-D tree algorithm. (2) In NSF, we present a nonlinear enhanced iterative fusion (EIF) strategy. EIF can strengthen high-weight edges presented in one (i.e., complementary information) or more (i.e., shared information) networks and weaken low-weight edges (i.e., redundant information). The retention of low-weight edges shared by all layers depends on the tightness of connections of their K-order proximity. The usage of higher-order proximity in EIF alleviates the dependence on the quality of node embedding. Besides, the fused network can be easily exploited by traditional single-layer network analysis methods. Experiments on real-world networks demonstrate that MNSF outperforms the state-of-the-art methods in tasks link prediction and shared community detection.


Author(s):  
Murray Stewart ◽  
T.J. Beveridge ◽  
D. Sprott

The archaebacterium Methanospirillum hungatii has a sheath as part of its cell wall which is composed mainly of protein. Treatment with dithiothreitol or NaOH released the intact sheaths and electron micrographs of this material negatively stained with uranyl acetate showed flattened hollow tubes, about 0.5 μm diameter and several microns long, in which the patterns from the top and bottom were superimposed. Single layers, derived from broken tubes, were also seen and were more simply analysed. Figure 1 shows the general appearance of a single layer. There was a faint axial periodicity at 28.5 A, which was stronger at irregular multiples of 28.5 A (3 and 4 times were most common), and fine striations were also seen at about 3° to the tube axis. Low angle electron diffraction patterns (not shown) and optical diffraction patterns (Fig. 2) from these layers showed a complex meridian (as a result of the irregular nature of the repeat along the tube axis) which showed a clear maximum at 28.5 A, consistent with the basic subunit spacing.


Sign in / Sign up

Export Citation Format

Share Document