Computing global structural balance in large-scale signed social networks

Proceedings of the National Academy of Sciences of the United States of America

Volumn 108, Issue 52, 2011, Pages 20953-20958

  Facchetti, Giuseppe ^a   Iacono, Giovanni ^a   Altafini, Claudio ^a  

^a SISSA   (Italy)

Author keywords

Combinatorial optimization; Social network theory

Indexed keywords

ARTICLE; FRUSTRATION; ONLINE SYSTEM; PRIORITY JOURNAL; SOCIAL NETWORK;

ALGORITHMS; CONFLICT (PSYCHOLOGY); HUMANS; INTERPERSONAL RELATIONS; MODELS, PSYCHOLOGICAL; SOCIAL SUPPORT;

EID: 84855504473     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1109521108     Document Type: Article

References (43)

1. Szell M, Lambiotte R, Thurner S (2010) Multirelational organization of large-scale social networks in an online world. Proc Natl Acad Sci USA 107:13636-13641.
2. Newman MEJ, Barabási AL, Watts DJ, eds. (2006) The Structure and Dynamics of Networks (Princeton Univ Press, Princeton).
3. Hogg T, Wilkinson D, Szabo G, Brzozowski M (2008) Multiple Relationship Types in Online Communities and Social Networks: American Association for Artificial Intelligence - Social Information Processing. (AAAI Press, Palo Alto, CA).
4. Palla G, Barabasi A-L, Vicsek T (2007) Quantifying social group evolution. Nature 446:664-667. (Pubitemid 46606882)
5. Albert R, Barabasi A-L (2000) Topology of evolving networks: Local events and universality. Phys Rev Lett 85:5234-5237. (Pubitemid 32871817)
6. Milo R, et al. (2002) Network motifs: Simple building blocks of complex networks. Science 298:824-827. (Pubitemid 35231534)
7. Vega-Redondo F (2007) Complex Social Networks (Cambridge Univ Press, Cambridge, UK).
8. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577-8582.
9. Borgatti SP, Mehra A, Brass DJ, Labianca G (2009) Network analysis in the social sciences. Science 323:892-895.
10. Wasserman S, Faust K (1994) Social Network Analysis: Methods and Applications (Cambridge Univ Press, Cambridge, UK).
11. Easley D, Kleinberg J (2010) Networks, Crowds, and Markets. Reasoning About a Highly Connected World (Cambridge Univ Press, Cambridge, UK).
12. Kunegis J, Lommatzsch A, Bauckhage C (2009) The Slashdot zoo: Mining a social network with negative edges, 18th International World Wide Web Conference. (Association for Computing Machinery, New York) p 741.
13. Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed Networks in Social Media, Conference on Human Factors in Computing Systems. (Association for Computing Machinery, New York).
14. Srinivasan A (2011) Local balancing influences global structure in social networks. Proc Natl Acad Sci USA 108:1751-1752.
15. Heider F (1946) Attitudes and cognitive organization. J Psychol 21:107-122.
16. Cartwright D, Harary F (1956) Structural balance: A generalization of Heider's theory. Psychol Rev 63:277-292.
17. Harary F, Kabell JA (1980) A simple algorithm to detect balance in signed graphs. Math Soc Sci 1:131-136.
18. Kunegis J, et al. (2010) Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization: Siam Conference on Data Mining 2010. (Society for Industrial and Applied Mathematics, Philadelphia), pp 559-570.
19. Maybee JS, Maybee SJ (1983) An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs. Math Soc Sci 6:99-103.
20. Harary F (1959) On the measurement of structural balance. Behav Sci 4:316-323.
21. Harary F (1960) A matrix criterion for structural balance. Nav Res Logist Q 7:195-199.
22. Barahona F (1982) On the computational complexity of Ising spin glass models. J Phys A Math Gen 15:3241-3253.
23. Commander CW (2009) Encyclopedia of Optimization, eds CA Floudas and PM Pardalos (Springer, New York), pp 1991-1999.
24. Festa P, Pardalos P, Resende M, Ribeiro C (2002) Randomized heuristics for the max-cut problem. Optim Method Softw 17:1033-1058.
25. Mezard M, Montanari A (2009) Information, Physics, and Computation (Oxford Univ Press, New York).
26. Galam S (1996) Fragmentation versus stability in bimodal coalitions. Physica A 230:174-188.
27. Antal T, Krapivsky PL, Redner S (2005) Dynamics of social balance on networks. Phys Rev E Stat Nonlin Soft Matter Phys 72:036121.
28. Marvel SA, Strogatz SH, Kleinberg JM (2009) Energy landscape of social balance. Phys Rev Lett 103:198701.
29. Hartmann AK, Rieger H (2001) Optimization Algorithms in Physics (Wiley, New York).
30. Martin OC (2005) New Optimization Algorithms in Physics, eds AK Hartmann and H Rieger (Wiley, New York).
31. Burer S, Monteiro R, Zhang Y (2002) Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J Optim 12:503-521.
32. Palagi L, Piccialli V, Rendl F, Rinaldi G, Wiegele A (2010) Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, eds MF Anjos and JB Lasserre (Centrum voor Werk en Inkomen, Amsterdam).
33. Iacono G, Ramezani F, Soranzo N, Altafini C (2010) Determining the distance to monotonicity of a biological network: A graph-theoretical approach. IET Syst Biol 4:223-235.
34. Toulouse G (1977) Theory of the frustration effect in spin glasses: I. Commun Phys 2:115-119.
35. Zaslavsky T (1982) Signed graphs. Discrete Appl Math 4:47-74.
36. Ciliberti S, Mézard M (2005) The theoretical capacity of the parity source coder. J Stat Mech P10003.
37. Wainwright MJ, Maneva E, Martinian E (2010) Lossy source compression using low-density generator matrix codes: Analysis and algorithms. IEEE Trans Inf Theory 56:1351-1368.
38. Binder K, Young AP (1986) Spin glasses: Experimental facts, theoretical concepts, and open questions. Rev Mod Phys 58:801-976.
39. Cover TM, Thomas JA (2006) Elements of Information Theory (Wiley Interscience, New York).
40. Guha R, Kumar R, Raghavan P, Tomkins A (2004) Propagation of trust and distrust: Proceedings of World Wide Web conference 2004. (Association for Computing Machinery, New York), pp 403-412.
41. Lampe CA, Johnston E, Resnick P (2007) Follow the Reader: Filtering Comments on Slashdot: Proceedings of Computer/Human Interaction 2007 Conference. (Association for Computing Machinery, New York), pp 1253-1262.
42. Burke M, Kraut R (2008) Mopping up: Modeling Wikipedia Promotion Decisions: Proceedings of Computer Supported Cooperative Work 2008. (Association for Computing Machinery, New York), pp 27-36.
43. Goemans M, Williamson D (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J Assoc Comput Mach 42:1115-1145.