Bobo Nick
ABSTRACT
Empirical social networks are often aggregate proxies for several heterogeneous relations. In online social networks, for instance, interactions related to friendship, kinship, business, interests, and other relationships may all be represented as catchall "friendships." Because several relations are mingled into one, the resulting networks exhibit relatively high and uniform density. As a consequence, the variation in positional differences and local cohesion may be too small for reliable analysis.
We introduce a method to identify the essential relationships in networks representing social interactions. Our method is based on a novel concept of triadic cohesion that is motivated by Simmel's concept of membership in social groups. We demonstrate that our Simmelian backbones are capable of extracting structure from Facebook interaction networks that makes them easy to visualize and analyze. Since all computations are local, the method can be restricted to partial networks such as ego networks, and scales to big data.
- A. L. Traud, E. D. Kelsic, P. J. Mucha, and M. A. Porter, "Comparing community structure to characteristics in online collegiate social networks," SIAM Review, vol. 53, no. 3, pp. 526--543, 2011. Google Scholar
Digital Library
- A. L. Traud, P. J. Mucha, and M. A. Porter, "Social structure of facebook network," Physica A, vol. 391, no. 16, pp. 4165--4180, 2012.Google ScholarCross Ref
- L. C. Freeman, "The sociological concept of 'group': An empirical test of two models," American Journal of Sociology, pp. 152--166, 1992.Google ScholarCross Ref
- S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, pp. 75--174, 2010.Google ScholarCross Ref
- P. Erdős and A. Rényi, "On random graphs," Publicationes Mathematicae Debrecen, vol. 6, pp. 290--297, 1959.Google ScholarCross Ref
- U. Brandes, G. Robins, A. McCranie, and S. Wasserman, "What is network science?" Network Science, vol. 1, no. 1, pp. 1--15, 2013.Google ScholarCross Ref
- O. Frank and D. Strauss, "Markov graphs," Journal of the American Statistical Association, vol. 81, pp. 832--842, 1986.Google ScholarCross Ref
- G. Robins, P. Pattison, Y. Kalish, and D. Lusher, "An introduction to exponential random graph (p*) models for social networks," Social Networks, vol. 29, no. 2, pp. 173--191, 2007.Google ScholarCross Ref
- T. A. B. Snijders, P. E. Pattison, G. L. Robins, and M. S. Handcock, "New specifications for exponential random graph models," Sociological Methodology, vol. 36, no. 1, pp. 99--153, 2006.Google ScholarCross Ref
- V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, p. P1000, 2008.Google ScholarCross Ref
- D. Krackhardt, "Simmelian ties: Super strong and sticky," in Power and Influence in Organizations, R. Kramer and M. Neale, Eds. SAGE, 1998, pp. 21--38.Google Scholar
- D. Krackhardt, "The ties that torture: Simmelian tie analysis in organizations," Research in the Sociology of Organizations, vol. 16, pp. 183--210, 1999.Google Scholar
- G. Simmel, The Sociology of Georg Simmel, K. H. Wolff, Ed. Free Press, 1950.Google Scholar
- G. Simmel, "Individual and society," in The Sociology of Georg Simmel, K. H. Wolf, Ed. Free Press, 1950.Google Scholar
- F. Heider, "Attitudes and cognitive organization," Journal of Psychology, vol. 21, pp. 107--112, 1946.Google ScholarCross Ref
- D. Krackhardt and M. S. Handcock, "Heider vs Simmel: Emergent features in dynamic structures," in ICML 2006, ser. LNCS, E. Airoldia, D. M. Blei, S. E. Fienberg, A. Goldenberg, E. P. Xing, and A. X. Zheng, Eds., 2007, vol. 4503, pp. 14--27. Google ScholarDigital Library
- M. Granovetter, "The strength of weak ties," The American Journal of Sociology, vol. 78, no. 6, pp. 1360--1380, 1973.Google ScholarCross Ref
- B. Wellman and M. Gulia, "The network basis of social support: A network is more than the sum of its ties," in Networks in a Global Village. Life in Contemporary Communities, B. Wellman, Ed. Westview Press, 1999, pp. 83--117.Google Scholar
- R. S. Burt, Structural holes: The social structure of competition. Harvard University Press, 1992.Google Scholar
- R. S. Burt, "Structural holes versus network closure as social capital," in Social Capital: Theory and Research. De Gruyter, 2001, pp. 31--56.Google Scholar
- D. Dekker, "Measures of Simmelian tie strength, Simmelian brokerage, and the Simmelianly brokered," Journal of Social Structure, vol. 7, no. 1, 2006.Google Scholar
- D. S. Goldberg and F. P. Roth, "Assessing experimentally derived interactions in a small world," PNAS, vol. 100, no. 8, pp. 4372--4376, 2003.Google ScholarCross Ref
- F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, "Defining and identifying communities in networks," PNAS, vol. 101, no. 9, pp. 2658--2663, 2004.Google ScholarCross Ref
- G. Melançon and A. Sallaberry, "Edge metrics for visual graph analytics: A comparative study," in Proc. 12th Intl. Conf. Information Visualization (IV'08), 2008, pp. 610--615. Google ScholarDigital Library
- R. M. Ripley, T. A. Snijders, and P. Preciado, "Manual for RSiena," 2012.Google Scholar
- R. Fagin, R. Kumar, and D. Sivakumar, "Comparing top k lists," in Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 28--36. Google ScholarDigital Library
- N. Chiba and T. Nishizeki, "Arboricity and subgraph listing algorithms," SIAM Journal on Computing, vol. 14, no. 1, pp. 210--223, 1985. Google ScholarDigital Library
- D. Eppstein and E. S. Spiro, "The h-index of a graph and its application to dynamic subgraph statistics," in Algorithms and Data Structures, ser. Lecture Notes in Computer Science, F. Dehne, M. Gavrilova, J.-R. Sack, and C. D. Tóth, Eds., 2009, vol. 5664, pp. 278--289. Google ScholarDigital Library
- C. Lee and P. Cunningham, "Benchmarking community detection methods on social media data," arXiv preprint arXiv:1302.0739, 2013.Google Scholar
- S. Fortunato and M. Barthelemy, "Resolution limit in community detection," PNAS, vol. 104, no. 1, pp. 36--41, 2007.Google ScholarCross Ref
- C. Lee, B. Nick, U. Brandes, and P. Cunningham, "Link prediction with social vector clocks," Proc. 19th ACM SIGKDD Conf. on Knowledge, Discovery, and Data Mining, 2013, to appear. Google ScholarDigital Library
Index Terms
- Simmelian backbones: amplifying hidden homophily in Facebook networks
Recommendations
Uses and gratifications of social networking sites for bridging and bonding social capital
Applying uses and gratifications theory (UGT) and social capital theory, our study examined users of four social networking sites (SNSs) (Facebook, Twitter, Instagram, and Snapchat), and their influence on online bridging and bonding social capital. ...
College students social media use and communication network heterogeneity
This study examined whether and how the usage of social media can influence college students' level of network heterogeneity and how network heterogeneity is associated with levels of bridging/bonding social capital and subjective well-being. In ...
Comments