Stavros Sintos
ABSTRACT
In the past few years there has been an explosion of social networks in the online world. Users flock these networks, creating profiles and linking themselves to other individuals. Connecting online has a small cost compared to the physical world, leading to a proliferation of connections, many of which carry little value or importance. Understanding the strength and nature of these relationships is paramount to anyone interesting in making use of the online social network data. In this paper, we use the principle of Strong Triadic Closure to characterize the strength of relationships in social networks. The Strong Triadic Closure principle stipulates that it is not possible for two individuals to have a strong relationship with a common friend and not know each other. We consider the problem of labeling the ties of a social network as strong or weak so as to enforce the Strong Triadic Closure property. We formulate the problem as a novel combinatorial optimization problem, and we study it theoretically. Although the problem is NP-hard, we are able to identify cases where there exist efficient algorithms with provable approximation guarantees. We perform experiments on real data, and we show that there is a correlation between the labeling we obtain and empirical metrics of tie strength, and that weak edges act as bridges between different communities in the network. Finally, we study extensions and variations of our problem both theoretically and experimentally.
Supplemental Material
- L. Backstrom and J. M. Kleinberg. Romantic partnerships and the dispersion of social ties: a network analysis of relationship status on facebook. In CSCW, pages 831--841, 2014. Google Scholar
Digital Library
- K. L. Clarkson. A modification of the greedy algorithm for vertex cover. IPL, 16(1):23--25, 1983.Google ScholarCross Ref
- J. A. Davis. Clustering and hierarchy in interpersonal relations. American Sociological Review, page 845.Google Scholar
- D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010. Google ScholarDigital Library
- N. Garg, V. V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In ICALP, volume 820, pages 487--498, 1994. Google ScholarDigital Library
- E. Gilbert. Predicting tie strength in a new medium. In CSCW, pages 1047--1056, 2012. Google ScholarDigital Library
- E. Gilbert and K. Karahalios. Predicting tie strength with social media. In CHI, pages 211--220, 2009. Google ScholarDigital Library
- M. Granovetter. The strength of weak ties. American Journal of Sociology, 78:1360--1380, 1973.Google ScholarCross Ref
- J. Hastad. Clique is hard to approximate within n(1-t). In Acta Mathematica, pages 627--636, 1996. Google ScholarDigital Library
- B. A. Huberman, D. M. Romero, and F. Wu. Social networks that matter: Twitter under the microscope. First Monday, 14, 2009.Google Scholar
- J. J. Jones, J. E. Settle, R. M. Bond, C. J. Fariss, C. Marlow, and J. H. Fowler. Inferring tie strength from online directed behavior. PLoS ONE 8, 2013.Google Scholar
- I. Kahanda and J. Neville. Using transactional information to predict link strength in online social networks. In ICWSM, 2009.Google Scholar
- D. E. Knuth. The stanford graphbase: A platform for combinatorial computing. Journal of Anthropological Research, 1993. Google Scholar
- G. Kossinets and D. Watts. Empirical analysis of an evolving social network. Science 311, pages 88--90, 2006.Google Scholar
- T. M. Newcomb. The Acquaintance Process. New York: Holt, Rinehart & Winston, 1961.Google Scholar
- J.-P. Onnela, J. Saramaki, J. Hyvonen, G. Szabo, D. Lazer, K. Kaski, J. Kertesz, and A.-L. Barabasi. Structure and tie strengths in mobile communication networks. PNAS USA, 104:7332--7336, 2007.Google ScholarCross Ref
- B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299 -- 301, 2004. Google ScholarDigital Library
- J. Tang, T. Lou, and J. Kleinberg. Inferring social ties across heterogenous networks. In WSDM, pages 743--752, 2012. Google ScholarDigital Library
- W. Tang, H. Zhuang, and J. Tang. Learning to infer social ties in large networks. In ECML/PKDD, pages 381--397, 2011. Google ScholarDigital Library
- J. Ugander, B. Karrer, L. Backstrom, and C. Marlow. The anatomy of the facebook social graph. CoRR, abs/1111.4503, 2011.Google Scholar
- V. V. Vazirani. Approximation algorithms. Springer, 2001. Google ScholarDigital Library
- R. Xiang, J. Neville, and M. Rogati. Modeling relationship strength in online social networks. In WWW Conference, pages 981--990, 2010. Google ScholarDigital Library
- W. W. Zachary. An information ow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452--473, 1977.Google ScholarCross Ref
Index Terms
- Using strong triadic closure to characterize ties in social networks
Recommendations
Inferring the Strength of Social Ties: A Community-Driven Approach
KDD '17: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data MiningOnline social networks are growing and becoming denser.The social connections of a given person may have very high variability: from close friends and relatives to acquaintances to people who hardly know. Inferring the strength of social ties is an ...
Will Triadic Closure Strengthen Ties in Social Networks?
The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social theories have been developed to understand its structure, such as triadic closure and social balance. Over the course of a ...
Mining triadic closure patterns in social networks
WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide WebA closed triad is a group of three people who are connected with each other. It is the most basic unit for studying group phenomena in social networks. In this paper, we study how closed triads are formed in dynamic networks. More specifically, given ...
Comments