A Spectral Algorithm for Computing Social Balance
We consider social networks in which links are associated with a sign; a positive (negative) sign indicates friendship (animosity) between the connected nodes. Recent work studies such large online signed networks by applying theories that stem from the notion of social balance. Computing the social balance of a signed network requires counting the distinct configurations of the signed edges within all possible triangles that appear in the network. A naive algorithm for such counting would require time that is cubic to the total number of nodes; such an algorithm is infeasible for large signed networks that are generated from online applications.
In this paper, we present an efficient spectral algorithm that computes approximate counts of the signed-triangle configurations. The essence of the algorithm lies in associating the eigenvalues of the adjacency matrix of a signed network with its signed-triangle configurations. Our experiments demonstrate that our algorithm introduces only a small error in the computed quantities while, at the same time, it achieves significant computational speedups.
KeywordsAdjacency Matrix Signed Network Online Social Network Connectivity Matrix Signed Graph
Unable to display preview. Download preview PDF.
- 1.Antal, T., Krapivsky, P.L., Redner, S.: Social balance on networks: The dynamics of friendship and enmity. Physica D 130 (2006)Google Scholar
- 2.Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286 (1999)Google Scholar
- 3.Brzozowski, M.J., Hogg, T., Szabá, G.: Friends and foes: ideological social networking. In: Human Factors in Computing Systems, CHI (2008)Google Scholar
- 4.Burke, M., Kraut, R.: Mopping up: modeling wikipedia promotion decisions. In: ACM Conference on Computer Supported Cooperative Work (CSCW), pp. 27–36. ACM Press, New York (2008)Google Scholar
- 8.Golub, G., Loan, C.V.: Matrix Computations. Johns Hopkins Press, Baltimore (1989)Google Scholar
- 9.Guha, R.V., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: International Conferece on World Wide Web (WWW), pp. 403–412 (2004)Google Scholar
- 13.Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: Mining a social network with negative edges. In: International Conference on World Wide Web (WWW), pp. 741–750 (2009)Google Scholar
- 14.Lampe, C., Johnston, E., Resnick, P.: Follow the reader: filtering comments on slashdot. In: Human Factors in Computing Systems, CHI (2007)Google Scholar
- 15.Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: International CIonference on World Wide Web (WWW), pp. 641–650 (2010)Google Scholar
- 16.Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Human Factors in Computing Systems (CHI), pp. 1361–1370 (2010)Google Scholar
- 17.Marvel, S., Kleinberg, J., Strogatz, S.: The energy landscape of social balance. Physical Review Letters 103(19) (2009)Google Scholar
- 18.Massa, P., Avesani, P.: Controversial users demand local trust metrics: an experimental study on epinions.com community. In: National Conference on Artificial Intelligence (AAAI), pp. 121–126 (2005)Google Scholar
- 19.Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: Algorithms and laws. In: International Conference on Data Mining (ICDM), pp. 608–617 (2008)Google Scholar
- 20.Tsourakakis, C.E., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles in power-law networks via element-wise sparsification. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 66–71 (2009)Google Scholar