Framework design for competitive marketing mechanism in Iraqi social media

Several organizations in Iraq manufacture similar commodities in this aggressive social trading. The objective of these organizations is diffusing information about their commodities publicly for popularity of the commodities in social media. More returns result in popular commodities and vice versa. The development of a framework incorporating two organizations engaging to broaden the information to the large media has been undertaken. The organizations first identified their initial seed points concurrently and then data was scattered as per the Independent Cascade Model (ICM). The major objective of the organizations is the identification of seed points for the diffusion of data to several points in social media. Significant is also how fast data diffusion can be done. Data effect will arise from either none, one or more nodes in a social interconnection. Evaluation is also accomplished on the number of fraction parts in various sections are affected by the different rates of data diffusion. The simulation result for suggested framework presented better outcomes result for random network 1 and random network 2 comparing with regular network. This framework is used a Hotellingframwork of competition.

Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition

We focus on the election manipulation problem through social influence, where a manipulator exploits a social network to make her most preferred candidate win an election. Influence is due to information in favor of and/or against one or multiple candidates, sent by seeds and spreading through the network according to the independent cascade model. We provide a comprehensive theoretical study of the election control problem, investigating two forms of manipulations: seeding to buy influencers given a social network and removing or adding edges in the social network given the set of the seeds and the information sent. In particular, we study a wide range of cases distinguishing in the number of candidates or the kind of information spread over the network. Our main result shows that the election manipulation problem is not affordable in the worst-case, even when one accepts to get an approximation of the optimal margin of victory, except for the case of seeding when the number of hard-to-manipulate voters is not too large, and the number of uncertain voters is not too small, where we say that a voter that does not vote for the manipulator's candidate is hard-to-manipulate if there is no way to make her vote for this candidate, and uncertain otherwise. We also provide some results showing the hardness of the problems in special cases. More precisely, in the case of seeding, we show that the manipulation is hard even if the graph is a line and that a large class of algorithms, including most of the approaches recently adopted for social-influence problems (e.g., greedy, degree centrality, PageRank, VoteRank), fails to compute a bounded approximation even on elementary networks, such as undirected graphs with every node having a degree at most two or directed trees. In the case of edge removal or addition, our hardness results also apply to election manipulation when the manipulator has an unlimited budget, being allowed to remove or add an arbitrary number of edges, and to the basic case of social influence maximization/minimization in the restricted case of finite budget. Interestingly, our hardness results for seeding and edge removal/addition still hold in a re-optimization variant, where the manipulator already knows an optimal solution to the problem and computes a new solution once a local modification occurs, e.g., the removal/addition of a single edge.

Spread of tweets in climate discussions: A case study of the 2019 Nobel Peace Prize announcement

Characterising the spreading of ideas within echo chambers is essential for understanding polarisation. In this article, we explore the characteristics of popular and viral content in climate change discussions on Twitter around the 2019 announcement of the Nobel Peace Prize, where we find the retweet network of users to be polarised into two well-separated groups of activists and sceptics. Operationalising popularity as the number of retweets and virality as the spreading probability inferred using an independent cascade model, we find that the viral themes echo and differ from the popular themes in interesting ways. Most importantly, we find that the most viral themes in the two groups reflect different types of bonds that tie the community together, yet both function to enhance ingroup connections while repulsing outgroup engagement. With this, our study sheds light, from an information-spreading perspective, on the formation and upkeep of echo chambers in climate discussions.

Information Contagion and Stock Price Crash Risk

We introduce continuity and temporariness into the independent cascade model to depict information diffusion in a social network. Investor behavior changes are determined according to the process of information diffusion, and the investment portfolio model consisting of sentiments is proposed to reveal the fire sales of stocks and the resulting stock price crash risk. Therefore, the relationship between information diffusion and stock price crash risk is established, and the contagion of stock price crash risk is analyzed from the perspective of information diffusion. Furthermore, some immunization strategies of networks are compared to prevent stock price crash risk. The results show that the tendency of stock price crash risk is consistent with that of information diffusion, which indicates that information diffusion before the fire sales is the key to triggering stock price crash risk. Moreover, investors with many ties contribute more to information diffusion than others; hence, immunization strategies of networks based on global information are more effective in preventing stock price crash risk than that based on local information. This study provides a new perspective for the study of contagion risk in the stock market, and it hints at the possibility of regulatory intervention to prevent stock price crash risk.

Influence Maximization Algorithm Based on Reverse Reachable Set

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range, and greatly reduce the time complexity. The experimental results on the two real data sets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm and pBmH algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large scale social network.