Measuring Partial Balance in Signed Networks

Is the enemy of an enemy necessarily a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and sufficient conditions for a network to be "balanced" were obtained around 1960. Since then the idea that signed networks tend over time to become more balanced has been widely used in several application areas. However, investigation of this hypothesis has been complicated by the lack of a standard measure of partial balance, since complete balance is almost never achieved in practice. We formalize the concept of a measure of partial balance, discuss various measures, compare the measures on synthetic datasets, and investigate their axiomatic properties. The synthetic data involves Erdős-Renyi and specially structured random graphs. We show that some measures behave better than others in terms of axioms and ability to differentiate between graphs. We also use well-known datasets from the sociology and biology literature, such as Read's New Guinean tribes, gene regulatory networks related to two organisms, and a network involving senate bill co-sponsorship. Our results show that substantially different levels of partial balance is observed under cycle-based, eigenvalue-based, and frustration-based measures. We make some recommendations for measures to be used in future work.

[1]  Fritz Heider,et al.  Social perception and phenomenal causality. , 1944 .

[2]  Evimaria Terzi,et al.  A Spectral Algorithm for Computing Social Balance , 2011, WAW.

[3]  Wei Chen,et al.  Voter Model on Signed Social Networks , 2015, Internet Math..

[4]  Jinhu Lü,et al.  An evolutionary game approach for determination of the structural conflicts in signed networks , 2016, Scientific Reports.

[5]  Eduardo D. Sontag,et al.  Algorithmic and complexity results for decompositions of biological networks into monotone subsystems , 2007, Biosyst..

[6]  David F. Gleich,et al.  Algorithms and Models for the Web Graph , 2014, Lecture Notes in Computer Science.

[7]  Maoguo Gong,et al.  A memetic algorithm for computing and transforming structural balance in signed networks , 2015, Knowl. Based Syst..

[8]  C. Altafini,et al.  Computing global structural balance in large-scale signed social networks , 2011, Proceedings of the National Academy of Sciences.

[9]  Jean Gallier,et al.  Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey , 2016, ArXiv.

[10]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[11]  Michele Benzi,et al.  Walk-based measure of balance in signed networks: detecting lack of balance in social networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Jérôme Kunegis,et al.  Applications of Structural Balance in Signed Social Networks , 2014, ArXiv.

[13]  Frank Harary,et al.  A matrix criterion for structural balance , 1960 .

[14]  Roberto Grossi,et al.  Optimal Listing of Cycles and st-Paths in Undirected Graphs , 2012, SODA.

[15]  Nicholas Harrigan,et al.  Why does everybody hate me? Balance, status, and homophily: The triumvirate of signed tie formation , 2015, Soc. Networks.

[16]  Yannis Manoussakis,et al.  Balance in Random Signed Graphs , 2012, Internet Math..

[17]  Zachary Neal,et al.  The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors , 2014, Soc. Networks.

[18]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[19]  Scott P. Robertson,et al.  Proceedings of the SIGCHI Conference on Human Factors in Computing Systems , 1991 .

[20]  B. Devadas Acharya,et al.  Spectral criterion for cycle balance in networks , 1980, J. Graph Theory.

[21]  G Iacono,et al.  Determining the distance to monotonicity of a biological network: a graph-theoretical approach. , 2010, IET systems biology.

[22]  Richard C. Wilson,et al.  Evaluating balance on social networks from their simple cycles , 2016, J. Complex Networks.

[23]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[24]  K. E. Read,et al.  Cultures of the Central Highlands, New Guinea , 1954, Southwestern Journal of Anthropology.

[25]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[26]  Vladimir Batagelj,et al.  Generalized blockmodeling , 2005, Structural analysis in the social sciences.

[27]  Mark C. Wilson,et al.  An exact method for computing the frustration index in signed networks using binary programming , 2016, ArXiv.

[28]  Francesco Belardo.  Balancedness and the least eigenvalue of Laplacian of signed graphs , 2014 .

[29]  R. Abelson,et al.  Symbolic psycho‐logic: A model of attitudinal cognition , 2007 .

[30]  Michael Szell,et al.  Measuring social dynamics in a massive multiplayer online game , 2009, Soc. Networks.

[31]  Patrick Doreian,et al.  Partitioning signed social networks , 2009, Soc. Networks.

[32]  Patrick Doreian,et al.  A multiple indicator approach to blockmodeling signed networks , 2008, Soc. Networks.

[33]  Marek S. Skrzypek,et al.  YPDTM, PombePDTM and WormPDTM: model organism volumes of the BioKnowledgeTM Library, an integrated resource for protein information , 2001, Nucleic Acids Res..

[34]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[35]  F. Harary.  On the measurement of structural balance , 2007 .

[36]  Nils M. Kriege,et al.  A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length , 2016, Algorithmica.

[37]  David Avis,et al.  Balancing signed graphs , 1981, Discret. Appl. Math..

[38]  James H. Fowler,et al.  Legislative cosponsorship networks in the US House and Senate , 2006, Soc. Networks.

[39]  Vladimir Batagelj,et al.  Generalized Blockmodeling (Structural Analysis in the Social Sciences) , 2004 .

[40]  Yaoping Hou.  Bounds for the Least Laplacian Eigenvalue of a Signed Graph , 2005 .

[41]  Patrick Doreian,et al.  Structural Balance and Signed International Relations , 2015, J. Soc. Struct..

[42]  Maoguo Gong,et al.  A particle swarm optimization approach for handling network social balance problem , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[43]  Ioan Tomescu,et al.  Note sur une caractérisation des graphes dont le degré de déséquilibre est maximal , 1973 .

[44]  Fred S. Roberts,et al.  A derivation of a measure of relative balance for social structures and a characterization of extensive ratio systems , 1972 .

[45]  T. Newcomb.  The acquaintance process , 1961 .

[46]  Julio Collado-Vides,et al.  RegulonDB (version 5.0): Escherichia coli K-12 transcriptional regulatory network, operon organization, and growth conditions , 2005, Nucleic Acids Res..

[47]  J. V. Rauff,et al.  Introduction to Mathematical Sociology , 2012 .

[48]  C. Prell.  Social Network Analysis: History, Theory and Methodology , 2011 .

[49]  Francesco Belardo,et al.  Signed Graphs with extremal least Laplacian eigenvalue , 2016 .

[50]  Ranveer Singh,et al.  Measuring the balance of signed networks and its application to sign prediction , 2017 .

[51]  Thomas Schwartz,et al.  The friend of my enemy is my enemy, the enemy of my enemy is my friend: Axioms for structural balance and bi-polarity , 2010, Math. Soc. Sci..

[52]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[53]  References , 1971 .

[54]  R. Solomon,et al.  Group Characteristics as Revealed in Sociometric Patterns and Personality Ratings , 1952 .

[55]  Filippo Maimone,et al.  Towards a class of complex networks models for conflict dynamics , 2012, ArXiv.

[56]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .