A new algorithm for positive influence maximization in signed networks

Minimizing the Spread of Negative Influence in SNIR Model by Contact Blocking

This paper presents a method to minimize the spread of negative influence on social networks by contact blocking. First, based on the infection-spreading process of COVID-19, the traditional susceptible, infectious, and recovered (SIR) propagation model is extended to the susceptible, non-symptomatic, infectious, and recovered (SNIR) model. Based on this model, we present a method to estimate the number of individuals infected by a virus at any given time. By calculating the reduction in the number of infected individuals after blocking contacts, the method selects the set of contacts to be blocked that can maximally reduce the affected range. The selection of contacts to be blocked is repeated until the number of isolated contacts that need to be blocked is reached or all infection sources are blocked. The experimental results on three real datasets and three synthetic datasets show that the algorithm obtains contact blockings that can achieve a larger reduction in the range of infection than other similar algorithms. This shows that the presented SNIR propagation model can more precisely reflect the diffusion and infection process of viruses in social networks, and can efficiently block virus infections.

Modeling multi-opinion propagation in complex systems with heterogeneous relationships via Potts model on signed networks

This paper investigates how the heterogenous relationships around us affect the spread of diverse opinions in the population. We apply the Potts model, derived from condensed matter physics on signed networks, to multi-opinion propagation in complex systems with logically contradictory interactions. Signed networks have received increasing attention due to their ability to portray both positive and negative associations simultaneously, while the Potts model depicts the coevolution of multiple states affected by interactions. Analyses and experiments on both synthetic and real signed networks reveal the impact of the topology structure on the emergence of consensus and the evolution of balance in a system. We find that, regardless of the initial opinion distribution, the proportion and location of negative edges in the signed network determine whether a consensus can be formed. The effect of topology on the critical ratio of negative edges reflects two distinct phenomena: consensus and the multiparty situation. Surprisingly, adding a small number of negative edges leads to a sharp breakdown in consensus under certain circumstances. The community structure contributes to the common view within camps and the confrontation (or alliance) between camps. The importance of inter- or intra-community negative relationships varies depending on the diversity of opinions. The results also show that the dynamic process causes an increase in network structural balance and the emergence of dominant high-order structures. Our findings demonstrate the strong effects of logically contradictory interactions on collective behaviors, and could help control multi-opinion propagation and enhance the system balance.

Behavior Variations and Their Implications for Popularity Promotions: From Elites to Mass on Weibo

The boom in social media with regard to producing and consuming information simultaneously implies the crucial role of online user influence in determining content popularity. In particular, understanding behavior variations between the influential elites and the mass grassroots is an important issue in communication. However, how their behavior varies across user categories and content domains and how these differences influence content popularity are rarely addressed. From a novel view of seven content domains, a detailed picture of the behavior variations among five user groups, from the views of both the elites and mass, is drawn on Weibo, one of the most popular Twitter-like services in China. Interestingly, elites post more diverse content with video links, while the mass possess retweeters of higher loyalty. According to these variations, user-oriented actions for enhancing content popularity are discussed and testified. The most surprising finding is that the diverse content does not always bring more retweets, and the mass and elites should promote content popularity by increasing their retweeter counts and loyalty, respectively. For the first time, our results demonstrate the possibility of highly individualized strategies of popularity promotions in social media, instead of a universal principle.

Role-Aware Information Spread in Online Social Networks

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.

LTHS: A heuristic algorithm based on local two-hop search strategy for influence maximization in social networks

Influence maximization is a classic network optimization problem, which has been widely used in the field of viral marketing. The influence maximization problem aims to find a fixed number of active nodes. After a specific propagation model, the number of active nodes reaches the maximum. However, the existing influence maximization algorithms are overly pursuing certain indicators of efficiency or accuracy, which cannot be well accepted by some researchers. This paper proposes an effective algorithm to balance the accuracy and efficiency of the influence maximization problem called local two-hop search algorithm (LTHS). The core of the proposed algorithm is a node not only be affected by one-hop neighbor nodes, but also by two-hop neighbor nodes. Firstly, this paper selects initial seed nodes according to the characteristics of the node degree. Generally, the high degree of nodes regards as influential nodes. Secondly, this paper proposes a node two-hop influence evaluate function called two-hop diffusion value (THDV), which can evaluate node influence more accurately. Furthermore, in order to seek higher efficiency, this paper proposes a method to reduce the network scale. This paper conducted full experiments on five real-world social network datasets, and compared with other four well-known algorithms. The experimental results show that the LTHS algorithm is better than the comparison algorithms in terms of efficiency and accuracy.

A robust optimization model for influence maximization in social networks with heterogeneous nodes

Influence maximization is the problem of trying to maximize the number of influenced nodes by selecting optimal seed nodes, given that influencing these nodes is costly. Due to the probabilistic nature of the problem, existing approaches deal with the concept of the expected number of nodes. In the current research, a scenario-based robust optimization approach is taken to finding the most influential nodes. The proposed robust optimization model maximizes the number of infected nodes in the last step of diffusion while minimizing the number of seed nodes. Nodes, however, are treated as heterogeneous with regard to their propensity to pass messages along; or as having varying activation thresholds. Experiments are performed on a real text-messaging social network. The model developed here significantly outperforms some of the well-known existing heuristic approaches which are proposed in previous works.

Identifying Influential Nodes Using a Shell-Based Ranking and Filtering Method in Social Networks

The main goal in the influence maximization problem (IMP) is to find k minimum nodes with the highest influence spread on the social networks. Since IMP is NP-hard and is not possible to obtain the optimum results, it is considered by heuristic algorithms. Many strategies focus on the power of the influence spread of core nodes to find k influential nodes. Most of the core detection-based methods concentrate on nodes in the highest core and often give the same power for all nodes in the best core. However, some other nodes fairly have the potential to select as seed nodes in other less important cores, because these nodes can play an important role in the diffusion of information among the core nodes with other nodes. Given this fact, this article proposes a new shell-based ranking and filtering method, called shell-based ranking and filtering method (SRFM), for selecting influential seeds with the aim to maximize influence in the network. The proposed algorithm initially selects a set of nodes in different shells. Moreover, a set of the candidate nodes are created, and most of the periphery nodes are removed during a pruning approach to reduce the computational overhead. Therefore, the seed nodes are selected from the candidate nodes set using the role of the bridge nodes. Experimental results in both synthetic and real data sets showed that the proposed SRFM algorithm has more acceptable efficiency in the influence spread and runtime than other algorithms.