scholarly journals Signed Network Modeling Based on Structural Balance Theory

Author(s):  
Tyler Derr ◽  
Charu Aggarwal ◽  
Jiliang Tang
2021 ◽  
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.


2020 ◽  
Vol 8 (1) ◽  
Author(s):  
Keith Burghardt ◽  
Zeev Maoz

Abstract The study of balance in signed networks has been a key topic for over 80 years. Starting with Heider’s theory of structural balance and Harary’s balance theorem, the measurement and understanding of structural balance in networks has grown exponentially. Most theoretical and empirical studies, however, focus on balance on the network as a whole, even though the degree of balance may strongly vary within the network. Our study makes two key contributions to this literature. First, we offer a methodology for measuring balance between nodes in a network. We show that dyadic (im)balance reveals significant information about localized balance that is not apparent in a global metric of balance. Second, we show that this metric can be applied to data containing multiple relations, for example, friendship, enmity, trade and fights, which reveals balance and imbalance otherwise hidden when focusing on only two relations (e.g. friends and enemies). Namely, while balance typically involves unweighted signed networks, multiple relations can naturally be condensed into a weighted signed network where positive (negative) weights correspond to a sum of positive (negative) relations between nodes. Our dyadic imbalance metric can then be applied to this and any other weighted signed network. These findings are illustrated with an international relations network as well as a network on roll call votes in the US Senate and compared to a null model that preserves network structure. We find weak agreement with Heider’s balance theory, including imbalance that decreases in time, and imbalance that is generally lower than our null model.


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.


2017 ◽  
Vol 123 (2) ◽  
pp. 510-548 ◽  
Author(s):  
Craig M. Rawlings ◽  
Noah E. Friedkin

2020 ◽  
Vol 3 (1) ◽  
Author(s):  
Omid Askarisichani ◽  
Ambuj K. Singh ◽  
Francesco Bullo ◽  
Noah E. Friedkin

AbstractThere has been longstanding interest in the evolution of positive and negative relationships among countries. An interdisciplinary field of study, Structural Balance Theory, has developed on the dynamics of such appraisal systems. However, the advancement of research in the field has been impeded by the lack of longitudinal empirical data on large-scale networks. We construct the networks of international amicable and hostile relations occurring in specific time-periods in order to study the global evolution of the network of such international appraisals. Here we present an empirical evidence on the alignment of Structural Balance Theory with the evolution of the structure of this network, and a model of the probabilistic micro-dynamics of the alterations of international appraisals during the period 1995-2018. Also remarkably, we find that the trajectory of the Frobenius norm of sequential transition probabilities, which govern the evolution of international appraisals among nations, dramatically stabilizes.


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.


2018 ◽  
Vol 4 (3) ◽  
pp. 301-312 ◽  
Author(s):  
Lianyong Qi ◽  
Xiaolong Xu ◽  
Xuyun Zhang ◽  
Wanchun Dou ◽  
Chunhua Hu ◽  
...  

2020 ◽  
Vol 7 (3) ◽  
pp. 696-708
Author(s):  
Xiaochen He ◽  
Haifeng Du ◽  
Xiangning Xu ◽  
Wei Du

Sign in / Sign up

Export Citation Format

Share Document