World War III analysis using signed social networks

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 World War III (WW III) comes into every individuals mind. Nevertheless, our paper aims at answering some of the interesting questions on WW III. In this paper, we have worked with the creation of a signed graph picturing the WW 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 dataset of World War III that contains the pairwise relationship data of countries with various parameters influencing prediction. This paper also validates and analyzes the predicted result.