Simmelian backbones: Amplifying hidden homophily in Facebook networks

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.

[1]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[2]  F. Heider Attitudes and cognitive organization. , 1946, The Journal of psychology.

[3]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[4]  Padraig Cunningham,et al.  Benchmarking community detection methods on social media data , 2013, ArXiv.

[5]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[7]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[8]  David Krackhardt,et al.  Heider vs Simmel: Emergent Features in Dynamic Structures , 2006, SNA@ICML.

[9]  D. Goldberg,et al.  Assessing experimentally derived interactions in a small world , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Linton C. Freeman,et al.  The Sociological Concept of "Group": An Empirical Test of Two Models , 1992, American Journal of Sociology.

[11]  Ove Frank,et al.  http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .

[12]  David Eppstein,et al.  Journal of Graph Algorithms and Applications the H-index of a Graph and Its Application to Dynamic Subgraph Statistics , 2022 .

[13]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[14]  D. Krackhardt Simmelian Ties: Super Strong and Sticky , 1998 .

[15]  Ulrik Brandes,et al.  What is network science? , 2013, Network Science.

[16]  Christos Faloutsos,et al.  Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining , 2013, ASONAM 2013.

[17]  P. Piccone,et al.  For Sociology , 1974, Telos.

[18]  Mason A. Porter,et al.  Comparing Community Structure to Characteristics in Online Collegiate Social Networks , 2008, SIAM Rev..

[19]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[21]  G. Simmel The sociology of Georg Simmel , 1950 .

[22]  Ruth M. Ripley,et al.  Manual for RSiena , 2011 .

[23]  Ronald Fagin,et al.  Comparing top k lists , 2003, SODA '03.

[24]  Guy Melançon,et al.  Edge Metrics for Visual Graph Analytics: A Comparative Study , 2008, 2008 12th International Conference Information Visualisation.

[25]  Samuel B. Bacharach,et al.  Research in the Sociology of Organization. , 1994 .

[26]  R. Burt Structural Holes versus Network Closure as Social Capital , 2001 .

[27]  David Dekker,et al.  Measures of Simmelian Tie Strength, Simmelian Brokerage, and, the Simmelianly Brokered , 2006, J. Soc. Struct..

[28]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[29]  Ulrik Brandes,et al.  Link prediction with social vector clocks , 2013, KDD.

[30]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[31]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[32]  H. Sampath,et al.  The Individual and Society* , 1989, Canadian journal of psychiatry. Revue canadienne de psychiatrie.