1
|
Role-Aware Information Spread in Online Social Networks. ENTROPY 2021; 23:e23111542. [PMID: 34828240 PMCID: PMC8618065 DOI: 10.3390/e23111542] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 10/02/2021] [Revised: 11/10/2021] [Accepted: 11/15/2021] [Indexed: 12/29/2022]
Abstract
Understanding the complex process of information spread in online social networks (OSNs) enables the efficient maximization/minimization of the spread of useful/harmful information. Users assume various roles based on their behaviors while engaging with information in these OSNs. Recent reviews on information spread in OSNs have focused on algorithms and challenges for modeling the local node-to-node cascading paths of viral information. However, they neglected to analyze non-viral information with low reach size that can also spread globally beyond OSN edges (links) via non-neighbors through, for example, pushed information via content recommendation algorithms. Previous reviews have also not fully considered user roles in the spread of information. To address these gaps, we: (i) provide a comprehensive survey of the latest studies on role-aware information spread in OSNs, also addressing the different temporal spreading patterns of viral and non-viral information; (ii) survey modeling approaches that consider structural, non-structural, and hybrid features, and provide a taxonomy of these approaches; (iii) review software platforms for the analysis and visualization of role-aware information spread in OSNs; and (iv) describe how information spread models enable useful applications in OSNs such as detecting influential users. We conclude by highlighting future research directions for studying information spread in OSNs, accounting for dynamic user roles.
Collapse
|
2
|
Aktas ME, Nguyen T, Jawaid S, Riza R, Akbas E. Identifying critical higher-order interactions in complex networks. Sci Rep 2021; 11:21288. [PMID: 34711855 PMCID: PMC8553861 DOI: 10.1038/s41598-021-00017-y] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/06/2021] [Accepted: 09/24/2021] [Indexed: 12/03/2022] Open
Abstract
Diffusion on networks is an important concept in network science observed in many situations such as information spreading and rumor controlling in social networks, disease contagion between individuals, and cascading failures in power grids. The critical interactions in networks play critical roles in diffusion and primarily affect network structure and functions. While interactions can occur between two nodes as pairwise interactions, i.e., edges, they can also occur between three or more nodes, which are described as higher-order interactions. This report presents a novel method to identify critical higher-order interactions in complex networks. We propose two new Laplacians to generalize standard graph centrality measures for higher-order interactions. We then compare the performances of the generalized centrality measures using the size of giant component and the Susceptible-Infected-Recovered (SIR) simulation model to show the effectiveness of using higher-order interactions. We further compare them with the first-order interactions (i.e., edges). Experimental results suggest that higher-order interactions play more critical roles than edges based on both the size of giant component and SIR, and the proposed methods are promising in identifying critical higher-order interactions.
Collapse
Affiliation(s)
- Mehmet Emin Aktas
- Department of Mathematics and Statistics, University of Central Oklahoma, Edmond, OK, 73034, USA.
| | - Thu Nguyen
- Department of Computer Science, University of Central Oklahoma, Edmond, OK, 73034, USA
| | - Sidra Jawaid
- Department of Mathematics and Statistics, University of Central Oklahoma, Edmond, OK, 73034, USA
| | - Rakin Riza
- Department of Computer Science, University of Central Oklahoma, Edmond, OK, 73034, USA
| | - Esra Akbas
- Department of Computer Science, Oklahoma State University, Stillwater, OK, 74074, USA
| |
Collapse
|
3
|
Yanez-Sierra J, Diaz-Perez A, Sosa-Sosa V. An Efficient Partition-Based Approach to Identify and Scatter Multiple Relevant Spreaders in Complex Networks. ENTROPY 2021; 23:e23091216. [PMID: 34573841 PMCID: PMC8468655 DOI: 10.3390/e23091216] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 08/11/2021] [Revised: 09/09/2021] [Accepted: 09/10/2021] [Indexed: 11/16/2022]
Abstract
One of the main problems in graph analysis is the correct identification of relevant nodes for spreading processes. Spreaders are crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases, rumors, and more. Correct identification of spreaders in graph analysis is a relevant task to optimally use the network structure and ensure a more efficient flow of information. Additionally, network topology has proven to play a relevant role in the spreading processes. In this sense, more of the existing methods based on local, global, or hybrid centrality measures only select relevant nodes based on their ranking values, but they do not intentionally focus on their distribution on the graph. In this paper, we propose a simple yet effective method that takes advantage of the underlying graph topology to guarantee that the selected nodes are not only relevant but also well-scattered. Our proposal also suggests how to define the number of spreaders to select. The approach is composed of two phases: first, graph partitioning; and second, identification and distribution of relevant nodes. We have tested our approach by applying the SIR spreading model over nine real complex networks. The experimental results showed more influential and scattered values for the set of relevant nodes identified by our approach than several reference algorithms, including degree, closeness, Betweenness, VoteRank, HybridRank, and IKS. The results further showed an improvement in the propagation influence value when combining our distribution strategy with classical metrics, such as degree, outperforming computationally more complex strategies. Moreover, our proposal shows a good computational complexity and can be applied to large-scale networks.
Collapse
|
4
|
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. Nat Commun 2021; 12:4009. [PMID: 34188036 PMCID: PMC8242091 DOI: 10.1038/s41467-021-24271-w] [Citation(s) in RCA: 10] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/01/2021] [Accepted: 06/10/2021] [Indexed: 02/06/2023] Open
Abstract
Selection and random drift determine the probability that novel mutations fixate in a population. Population structure is known to affect the dynamics of the evolutionary process. Amplifiers of selection are population structures that increase the fixation probability of beneficial mutants compared to well-mixed populations. Over the past 15 years, extensive research has produced remarkable structures called strong amplifiers which guarantee that every beneficial mutation fixates with high probability. But strong amplification has come at the cost of considerably delaying the fixation event, which can slow down the overall rate of evolution. However, the precise relationship between fixation probability and time has remained elusive. Here we characterize the slowdown effect of strong amplification. First, we prove that all strong amplifiers must delay the fixation event at least to some extent. Second, we construct strong amplifiers that delay the fixation event only marginally as compared to the well-mixed populations. Our results thus establish a tight relationship between fixation probability and time: Strong amplification always comes at a cost of a slowdown, but more than a marginal slowdown is not needed.
Collapse
Affiliation(s)
- Josef Tkadlec
- grid.38142.3c000000041936754XDepartment of Mathematics, Harvard University, Cambridge, MA 02138 USA
| | - Andreas Pavlogiannis
- grid.7048.b0000 0001 1956 2722Department of Computer Science, Aarhus University, Aabogade 34, 8200 Aarhus, Denmark
| | - Krishnendu Chatterjee
- grid.33565.360000000404312247Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria
| | - Martin A. Nowak
- grid.38142.3c000000041936754XDepartment of Mathematics, Harvard University, Cambridge, MA 02138 USA
| |
Collapse
|
5
|
Dong Z, Chen Y, Tricco TS, Li C, Hu T. Hunting for vital nodes in complex networks using local information. Sci Rep 2021; 11:9190. [PMID: 33911157 PMCID: PMC8080708 DOI: 10.1038/s41598-021-88692-9] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/11/2021] [Accepted: 03/24/2021] [Indexed: 02/03/2023] Open
Abstract
Complex networks in the real world are often with heterogeneous degree distributions. The structure and function of nodes can vary significantly, with vital nodes playing a crucial role in information spread and other spreading phenomena. Identifying and taking action on vital nodes enables change to the network's structure and function more efficiently. Previous work either redefines metrics used to measure the nodes' importance or focuses on developing algorithms to efficiently find vital nodes. These approaches typically rely on global knowledge of the network and assume that the structure of the network does not change over time, both of which are difficult to achieve in the real world. In this paper, we propose a localized strategy that can find vital nodes without global knowledge of the network. Our joint nomination (JN) strategy selects a random set of nodes along with a set of nodes connected to those nodes, and together they nominate the vital node set. Experiments are conducted on 12 network datasets that include synthetic and real-world networks, and undirected and directed networks. Results show that average degree of the identified node set is about 3-8 times higher than that of the full node set, and higher-degree nodes take larger proportions in the degree distribution of the identified vital node set. Removal of vital nodes increases the average shortest path length by 20-70% over the original network, or about 8-15% longer than the other decentralized strategies. Immunization based on JN is more efficient than other strategies, consuming around 12-40% less immunization resources to raise the epidemic threshold to [Formula: see text]. Susceptible-infected-recovered simulations on networks with 30% vital nodes removed using JN delays the arrival time of infection peak significantly and reduce the total infection scale to 15%. The proposed strategy can effectively identify vital nodes using only local information and is feasible to implement in the real world to cope with time-critical scenarios such as the sudden outbreak of COVID-19.
Collapse
Affiliation(s)
- Zhihao Dong
- grid.25055.370000 0000 9130 6822Department of Computer Science, Memorial University of Newfoundland, St. John’s, A1C 5S7 Canada
| | - Yuanzhu Chen
- grid.25055.370000 0000 9130 6822Department of Computer Science, Memorial University of Newfoundland, St. John’s, A1C 5S7 Canada
| | - Terrence S. Tricco
- grid.25055.370000 0000 9130 6822Department of Computer Science, Memorial University of Newfoundland, St. John’s, A1C 5S7 Canada ,grid.422172.0Verafin Inc., Data Scientist, St. John’s, A1A 0L9 Canada
| | - Cheng Li
- grid.25055.370000 0000 9130 6822Department of Electrical and Computer Engineering, Memorial University of Newfoundland, St. John’s, A1C 5S7 Canada
| | - Ting Hu
- grid.410356.50000 0004 1936 8331School of Computing, Queen’s University, Kingston, K7L 3N6 Canada
| |
Collapse
|
6
|
Strategically positioning cooperators can facilitate the contagion of cooperation. Sci Rep 2021; 11:1127. [PMID: 33441930 PMCID: PMC7806618 DOI: 10.1038/s41598-020-80770-8] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/25/2020] [Accepted: 12/22/2020] [Indexed: 11/30/2022] Open
Abstract
The spreading of cooperation in structured population is a challenging problem which can be observed at different scales of social and biological organization. Generally, the problem is studied by evaluating the chances that few initial invading cooperators, randomly appearing in a network, can lead to the spreading of cooperation. In this paper we demonstrate that in many scenarios some cooperators are more influential than others and their initial positions can facilitate the spreading of cooperation. We investigate six different ways to add initial cooperators in a network of cheaters, based on different network-based measurements. Our research reveals that strategically positioning the initial cooperators in a population of cheaters allows to decrease the number of initial cooperators necessary to successfully seed cooperation. The strategic positioning of initial cooperators can also help to shorten the time necessary for the restoration of cooperation. The optimal ways in which the initial cooperators should be placed is, however, non-trivial in that it depends on the degree of competition, the underlying game, and the network structure. Overall, our results show that, in structured populations, few cooperators, well positioned in strategically chosen places, can spread cooperation faster and easier than a large number of cooperators that are placed badly.
Collapse
|
7
|
Yang G, Cavaliere M, Zhu C, Perc M. Ranking the invasions of cheaters in structured populations. Sci Rep 2020; 10:2231. [PMID: 32042010 PMCID: PMC7010670 DOI: 10.1038/s41598-020-59020-4] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/17/2019] [Accepted: 01/24/2020] [Indexed: 12/01/2022] Open
Abstract
The identification of the most influential individuals in structured populations is an important research question, with many applications across the social and natural sciences. Here, we study this problem in evolutionary populations on static networks, where invading cheaters can lead to the collapse of cooperation. We propose six strategies to rank the invading cheaters and identify those which mostly facilitate the collapse of cooperation. We demonstrate that the type of successful rankings depend on the selection strength, the underlying game, and the network structure. We show that random ranking has generally little ability to successfully identify invading cheaters, especially for the stag-hunt game in scale-free networks and when the selection strength is strong. The ranking based on degree can successfully identify the most influential invaders when the selection strength is weak, while more structured rankings perform better at strong selection. Scale-free networks and strong selection are generally detrimental to the performance of the random ranking, but they are beneficial for the performance of structured rankings. Our research reveals how to identify the most influential invaders using statistical measures in structured communities, and it demonstrates how their success depends on population structure, selection strength, and on the underlying game dynamics.
Collapse
Affiliation(s)
- Guoli Yang
- Unit 66136, Beijing, 100042, China.,Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China
| | - Matteo Cavaliere
- Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, United Kingdom
| | - Cheng Zhu
- Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China
| | - Matjaž Perc
- Faculty of Natural Sciences and Mathematics, University of Maribor, Koroška cesta 160, 2000, Maribor, Slovenia. .,Department of Medical Research, China Medical University Hospital, China Medical University, 404, Taichung, Taiwan. .,Complexity Science Hub Vienna, Josefstädterstraße 39, 1080, Vienna, Austria.
| |
Collapse
|
8
|
Abstract
This paper analyzes Cournot duopoly games that are constructed based on Cobb–Douglas preferences. We introduce here two models whose dynamic adjustments depend on bounded rationality, dynamic adjustment, and tit-for-tat mechanism. In the first model, we have two firms with limited information and due to that they adopt the bounded rationality mechanism. They update their productions based on the changing occurred in the marginal profit. For this model, its fixed point is obtained and its stability condition is calculated. In addition, we provide conditions by which this fixed point loses its stability due to flip and Neimark–Sacker bifurcations. Furthermore, numerical simulation shows that this model possesses some chaotic behaviors which are recovered due to corridor stability. In the second model, we handle two different mechanisms of cooperation. These mechanisms are dynamic adjustment process and tit-for-tat strategy. The players who use the dynamic adjustment increase their productions based on the cooperative output while, in tit-for-tat mechanism, they increase the productions based on the cooperative profit. The local stability analysis shows that adopting tit-for-tat makes the model unstable and then the system becomes chaotic for any values of the system’s parameters. The obtained results show that the dynamic adjustment makes the system’s fixed point stable for a certain interval of the adjustment parameter.
Collapse
|