Simmelian backbones: Amplifying hidden homophily in Facebook networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013

Volumn , Issue , 2013, Pages 525-532

  Nick, Bobo ^a   Lee, Conrad ^b   Cunningham, Pádraig ^b   Brandes, Ulrik ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ADHESION;

EGO NETWORKS; HOMOPHILY; IN NETWORKS; INTERACTION NETWORKS; NOVEL CONCEPT; ON-LINE SOCIAL NETWORKS; SOCIAL GROUPS; SOCIAL INTERACTIONS;

SOCIAL NETWORKING (ONLINE);

EID: 84893210696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492517.2492569     Document Type: Conference Paper

References (31)

1. 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.
2. 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.
3. L. C. Freeman, "The sociological concept of group: An empirical test of two models, " American Journal of Sociology, pp. 152-166, 1992.
4. S. Fortunato, "Community detection in graphs, " Physics Reports, vol. 486, pp. 75-174, 2010.
5. P. Erdos and A. Rényi, "On random graphs, " Publicationes Mathematicae Debrecen, vol. 6, pp. 290-297, 1959.
6. U. Brandes, G. Robins, A. McCranie, and S. Wasserman, "What is network science?" Network Science, vol. 1, no. 1, pp. 1-15, 2013.
7. O. Frank and D. Strauss, "Markov graphs, " Journal of the American Statistical Association, vol. 81, pp. 832-842, 1986.
8. 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.
9. 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.
10. 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.
11. 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.
12. -, "The ties that torture: Simmelian tie analysis in organizations, " Research in the Sociology of Organizations, vol. 16, pp. 183-210, 1999.
13. G. Simmel, The Sociology of Georg Simmel, K. H. Wolff, Ed. Free Press, 1950.
14. -, "Individual and society, " in The Sociology of Georg Simmel, K. H. Wolf, Ed. Free Press, 1950.
15. F. Heider, "Attitudes and cognitive organization, " Journal of Psychology, vol. 21, pp. 107-112, 1946.
16. 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.
17. M. Granovetter, "The strength of weak ties, " The American Journal of Sociology, vol. 78, no. 6, pp. 1360-1380, 1973.
18. 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.
19. R. S. Burt, Structural holes: The social structure of competition. Harvard University Press, 1992.
20. -, "Structural holes versus network closure as social capital, " in Social Capital: Theory and Research. De Gruyter, 2001, pp. 31-56.
21. D. Dekker, "Measures of Simmelian tie strength, Simmelian brokerage, and the Simmelianly brokered, " Journal of Social Structure, vol. 7, no. 1, 2006.
22. D. S. Goldberg and F. P. Roth, "Assessing experimentally derived interactions in a small world, " PNAS, vol. 100, no. 8, pp. 4372-4376, 2003.
23. 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.
24. 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.
25. R. M. Ripley, T. A. Snijders, and P. Preciado, "Manual for RSiena, " 2012.
26. R. Fagin, R. Kumar, and D. Sivakumar, "Comparing top κ lists, " in Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 28-36.
27. N. Chiba and T. Nishizeki, "Arboricity and subgraph listing algorithms, " SIAM Journal on Computing, vol. 14, no. 1, pp. 210-223, 1985.
28. 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.
29. C. Lee and P. Cunningham, "Benchmarking community detection methods on social media data, " arXiv preprint arXiv:1302.0739, 2013.
30. S. Fortunato and M. Barthelemy, "Resolution limit in community detection, " PNAS, vol. 104, no. 1, pp. 36-41, 2007.
31. 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.