Social contagions on correlated multiplex networks

2018 ◽  
Vol 499 ◽  
pp. 121-128 ◽  
Author(s):  
Wei Wang ◽  
Meng Cai ◽  
Muhua Zheng
Keyword(s):  
Author(s):  
Guanying Huo ◽  
Xin Jiang ◽  
Lili Ma ◽  
Quantong Guo ◽  
Yifang Ma ◽  
...  

2020 ◽  
Vol 2 (4) ◽  
Author(s):  
Dana Vaknin ◽  
Bnaya Gross ◽  
Sergey V. Buldyrev ◽  
Shlomo Havlin

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Seyed Hossein Jafari ◽  
Amir Mahdi Abdolhosseini-Qomi ◽  
Masoud Asadpour ◽  
Maseud Rahgozar ◽  
Naser Yazdani

AbstractThe entities of real-world networks are connected via different types of connections (i.e., layers). The task of link prediction in multiplex networks is about finding missing connections based on both intra-layer and inter-layer correlations. Our observations confirm that in a wide range of real-world multiplex networks, from social to biological and technological, a positive correlation exists between connection probability in one layer and similarity in other layers. Accordingly, a similarity-based automatic general-purpose multiplex link prediction method—SimBins—is devised that quantifies the amount of connection uncertainty based on observed inter-layer correlations in a multiplex network. Moreover, SimBins enhances the prediction quality in the target layer by incorporating the effect of link overlap across layers. Applying SimBins to various datasets from diverse domains, our findings indicate that SimBins outperforms the compared methods (both baseline and state-of-the-art methods) in most instances when predicting links. Furthermore, it is discussed that SimBins imposes minor computational overhead to the base similarity measures making it a potentially fast method, suitable for large-scale multiplex networks.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Bruno Cesar Barreto De Figueiredo ◽  
Fabiola Guerra Nakamura ◽  
Eduardo Freire Nakamura
Keyword(s):  

2021 ◽  
Vol 54 (3) ◽  
pp. 1-35
Author(s):  
Matteo Magnani ◽  
Obaida Hanteer ◽  
Roberto Interdonato ◽  
Luca Rossi ◽  
Andrea Tagarelli

A multiplex network models different modes of interaction among same-type entities. In this article, we provide a taxonomy of community detection algorithms in multiplex networks. We characterize the different algorithms based on various properties and we discuss the type of communities detected by each method. We then provide an extensive experimental evaluation of the reviewed methods to answer three main questions: to what extent the evaluated methods are able to detect ground-truth communities, to what extent different methods produce similar community structures, and to what extent the evaluated methods are scalable. One goal of this survey is to help scholars and practitioners to choose the right methods for the data and the task at hand, while also emphasizing when such choice is problematic.


Sign in / Sign up

Export Citation Format

Share Document