scholarly journals World War III Analysis Using Signed Social Networks

Author(s):  
Ranjana Roy Chowdhury ◽  
Shivam Gupta ◽  
Sravanthi Chede

Abstract In the recent period of time with a lot of social platforms emerging, the relationships among various units can be framed with respect to either positive, negative or no relation. These units can be individuals, countries or others that form the basic structural component of a signed network. These signed networks picture a dynamic characteristic of the graph so formed allowing only few combinations of signs that brings the structural balance theorem in picture. Structural balance theory affirms that signed social networks tend to be organized so as to avoid conflictual situations, corresponding to cycles of unstable relations. The aim of structural balance in networks is to find proper partitions of nodes that guarantee equilibrium in the system allowing only few combination triangles with signed edges to be permitted in graph. Most of the works in this field of networking have either explained the importance of signed graph or have applied the balance theorem and tried to solve problems. Following the recent time trends with each nation emerging to be superior and competing to be the best, the probable doubt of happening of WW-III(World War-III) comes into every individuals mind. Nevertheless, our paper aims at answering some of the interesting questions on World War-III. In this project we have worked with the creation of a signed graph picturing the World War-III participating countries as nodes and have predicted the best possible coalition of countries that will be formed during war. Also, we have visually depicted the number of communities that will be formed in this war and the participating countries in each communities. Our paper involves extensive analysis on the various parameters influencing the above predictions and also creation of a new data-set of World War -III that contains the pairwise relationship data of countries with various parameters influencing prediction. This paper also validates and analyses the predicted result.

2019 ◽  
Vol 33 (19) ◽  
pp. 1950211
Author(s):  
Xiaoyu Zhu ◽  
Yinghong Ma

In social networks, individuals are usually but not exactly divided into communities such that within each community people are friendly to each other while being hostile towards other communities. This is in line with structural balance theory which enables a comprehensive understanding of the stability and tensions of social systems. Yet, there may be some conflicts such as the intra-community negative edges or inter-community positive edges that affect the balancedness of the social system. This raises an interesting question of how to partition a signed network for minimal conflicts, i.e., maximum balancedness. In this paper, by analyzing the relationship between balancedness and spectrum space, we find that each eigenvector can be an indicator of dichotomous structure of networks. Incorporating the leader mechanism, we partition signed networks to maximize the balancedness with top-k eigenvectors. Moreover, we design an optimizing segment to further improve the balancedness of the network. Experimental data both from real social and synthetic networks demonstrate that the spectral algorithm has higher efficiency, robustness and scientificity.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Ranjana Roy Chowdhury ◽  
Shivam Gupta ◽  
Sravanthi Chede

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Angela Fontan ◽  
Claudio Altafini

AbstractIn parliamentary democracies, government negotiations talks following a general election can sometimes be a long and laborious process. In order to explain this phenomenon, in this paper we use structural balance theory to represent a multiparty parliament as a signed network, with edge signs representing alliances and rivalries among parties. We show that the notion of frustration, which quantifies the amount of “disorder” encoded in the signed graph, correlates very well with the duration of the government negotiation talks. For the 29 European countries considered in this study, the average correlation between frustration and government negotiation talks ranges between 0.42 and 0.69, depending on what information is included in the edges of the signed network. Dynamical models of collective decision-making over signed networks with varying frustration are proposed to explain this correlation.


2015 ◽  
Vol 29 (13) ◽  
pp. 1550079 ◽  
Author(s):  
Pei Li ◽  
Yini Zhang ◽  
Su He ◽  
Hui Wang

Social networks have attracted remarkable attention and it is of great importance to understand the process of opinion spreading in popular social networks. However, most research on diffusion cannot be applied directly to investigate social networks, where relationships are heterogeneous and structural balance is a common phenomenon. In this paper, we propose models to characterize the process of opinion spreading in signed social networks under the impact of structural balance. We classify users into different types according to the numbers of their positive links, and define the term user influence to represent the average number of times that users are influenced, which is incurred by a user spreading an opinion. We then propose an approach to analyze the user influence theoretically and the analysis accuracy is verified by simulations. We observe that the user influence increases with user type and also increases with the fraction of negative links in the network if this fraction value exceeds some point. That's to say, negative relationships may enhance opinion spreading if we consider the impact of structural balance, which is an interesting result.


Entropy ◽  
2019 ◽  
Vol 21 (8) ◽  
pp. 728
Author(s):  
Mingze Qi ◽  
Hongzhong Deng ◽  
Yong Li

In social networks comprised of positive (P) and negative (N) symmetric relations, individuals (nodes) will, under the stress of structural balance, alter their relations (links or edges) with their neighbours, either from positive to negative or vice versa. In the real world, individuals can only observe the influence of their adjustments upon the local balance of the network and take this into account when adjusting their relationships. Sometime, their local adjustments may only respond to their immediate neighbourhoods, or centre upon the most important neighbour. To study whether limited memory affects the convergence of signed social networks, we introduce a signed social network model, propose random and minimum memory-based sign adjustment rules, and analyze and compare the impacts of an initial ratio of positive links, rewire probability, network size, neighbor number, and randomness upon structural balance under these rules. The results show that, with an increase of the rewiring probability of the generated network and neighbour number, it is more likely for the networks to globally balance under the minimum memory-based adjustment. While the Newmann-Watts small world model (NW) network becomes dense, the counter-intuitive phenomena emerges that the network will be driven to a global balance, even under the minimum memory-based local sign adjustment, no matter the network size and initial ratio of positive links. This can help to manage and control huge networks with imited resources.


Sign in / Sign up

Export Citation Format

Share Document