Low-distortion inference of latent similarities from a multiplex social network

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 1853-1872

  Abraham, Ittai ^a   Chechik, Shiri ^a   Kempe, David ^b   Slivkins, Aleksandrs ^a  

^a MICROSOFT RESEARCH   (United States)

^b University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCRETE MODEL; GEOGRAPHICAL PROXIMITY; LOW DISTORTION; MULTIPLEX SOCIAL NETWORKS; NEAR-LINEAR TIME; RESEARCH QUESTIONS; SMALL WORLD MODEL; SOCIAL STRUCTURE;

CLUSTERING ALGORITHMS;

EID: 84876019623     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.132     Document Type: Conference Paper

References (55)

1. Ittai Abraham, Shiri Chechik, David Kempe, and Aleksandrs Slivkins. Low-distortion inference of latent simlarities from a multiplex social network. Eprint arXiv:1202.0922, 2012.
2. Lada A. Adamic and Eytan Adar. Friends and neighbors on the web. Social Networks, 25:211-230, 2003.
3. Lada A. Adamic and Eytan Adar. How to search a social network. Social Networks, 27(3):187-203, 2005.
4. Sanjeev Arora, Rong Ge, Sushant Sachdeva, and Grant Schoenebeck. Finding overlapping communities in social networks: Toward a rigorous approach. In Proc. 14th ACM Conf. on Electronic Commerce, pages 37-54, 2012. arXiv: 1112.1831.
5. Lars Backstrom, Eric Sun, and Cameron Marlow. Find me if you can: improving geographical prediction with social and spatial proximity. In 19th Intl. World Wide Web Conference, pages 61-70, 2010.
6. Maria-Fiorina Balcan, Christian Borgs, Mark Braverman, Jennifer Chayes, and Shang-Hua Teng. Finding endogenously formed communities. In Proc. 24th ACM-SIAM Symp. on Discrete Algorithms, 2013.
7. Marc Barthélémy. Spatial Networks. Physics Reports, 499:1-101, 2011.
8. Peter M. Blau. Inequality and Heterogeneity: A Primitive Theory of Social Structure. Free Press, 1977.
9. Ulrik Brandes and Thomas Erlebach, editors. Network Analysis. Springer, 2005.
10. Carter T. Butts. Predictability of large-scale spatially embedded networks. In Dynamic Social Network Modeling and Analysis: Workshop summary and papers, pages 313-323, 2003.
11. Hubert T-H. Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. On hierarchical routing in doubling metrics. In 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 762-771, 2005. Full and updated version available as a Carnegie Mellon University ETR CMU-PDL-04-106.
12. Aaron Clauset, Cris Moore, and Mark Newman. Hierarchical structure and the prediction of missing links in networks. Nature, 453:98-101, 2008.
13. Leon Danon, Jordi Duch, Albert Diaz-Guilera, and Alex Arenas. Comparing community structure identification. J. Stat. Mech., 2005.
14. Devdatt P. Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
15. Stephen E. Fienberg, Michael M. Meyer, and Stanley S. Wasserman. Statistical analysis of multiple sociometric relations. J. American Statistical Association, 80(389):51-67, 1985.
16. Santo Fortunato. Community detection in graphs. Physics Reports, 486:75-174, 2010. Eprint arXiv: 0906.0612.
17. Santo Fortunato and Claudio Castellano. Community structure in graphs. In R. Meyers, editor, Encyclopedia of Complexity and System Science. Springer, 2009. Eprint arXiv:0712.2716.
18. Pierre Fraigniaud. Small worlds as navigable augmented networks: Model, analysis, and validation. In Proc. 15th European Symp. on Algorithms, pages 2-11, 2007.
19. Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. A doubling dimension threshold Θ(log log n) for augmented graph navigability. In Proc. 14th European Symp. on Algorithms, pages 376-386, 2006.
20. Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. Recovering the long-range links in augmented graphs. Theoretical Computer Science, 411(14-15):1613-1625, 2010.
21. Sharad Goel and Daniel G. Goldstein. Predicting behavior with social networks. Unpublished Manuscript, 2010.
22. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44thIEEE Symp. on Foundations of Computer Science, pages 534-543, 2003.
23. Mark S. Handcock, Adrian E. Raftery, and Jeremy M. Tantrum. Model-based clustering for social networks (with discussion). Journal of the Royal Statistical Society, Series A, 170:301-354, 2007.
24. Peter D. Hoff, Adrian E. Raftery, and Mark S. Handcock. Latent space approaches to social network analysis. Journal of the American Statistical Association, 97:1090-1098, 2002.
25. Anne-Marie Kermarrec, Vincent Leroy, and Gilles Trédan. Distributed social graph embedding. Technical Report RR-7327, INRIA, 2010.
26. Jon Kleinberg. Navigation in a small world. Nature, 406:485, 2000.
27. Jon Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symp. on Theory of Computing, pages 163-170, 2000.
28. Jon Kleinberg. Small-world phenomena and the dynamics of information. In Proc. 13th Advances in Neural Information Processing Systems, pages 431-438, 2001.
29. Jon Kleinberg. Complex networks and decentralized search algorithms. In Proc. Intl. Congress of Mathematicians (ICM), 2006.
30. Jon Kleinberg, Aleksandrs Slivkins, and Tom Wexler. Triangulation and Embedding Using Small Sets of Beacons. Journal of the ACM, 56(6), September 2009. Preliminary version in Proc. 45th IEEE Symp. on Foundations of Computer Science.
31. Pavel N. Krivitsky, Mark S. Handcock, Adrian E. Raftery, and Peter D. Hoff. Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models. Social Networks, 31:204-213, 2009.
32. Paul Lazarsfeld and Robert K. Merton. Friendship as a social process: A substantive and methodological analysis. In Morroe Berger, Theodore Abel, and Charles H. Page, editors, Freedom and Control in Modern Society, pages 18-66. Van Nostrand, 1954.
33. David Liben-Nowell and Jon Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007.
34. David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, and Andrew Tomkins. Geographic routing in social networks. Proc. Natl. Acad. Sci. USA, 102:11623-11628, 2005.
35. Kun Liu and Lei Tang. Large scale behavioral targeting with a social twist. In Proc. 20th ACM Conf. on Information and Knowledge Management (CIKM), 2011.
36. Peter Marsden and Noah E. Friedkin. Network studies of social influnce. Sociological Measures and Research, 22(1):127-151, 1993.
37. David D. McFarland and Daniel J. Brown. Social distance as a metric: A systematic introduction to smallest space analysis. In Edward O. Laumann, editor, Bonds of Pluralism: The Form and Substance of Urban Social Networks, pages 213-253. Wiley, 1973.
38. Miller McPherson, Lynn Smith-Lovin, and James M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27:415-444, 2001.
39. Michael J. Minor. New directions in multiplexity analysis. In Ronald S. Burt and Michael J. Minor, editors, Applied Network Analysis, pages 223-244. Sage Publications, 1983.
40. Van Nguyen and Charles U. Martel. Analyzing and characterizing small-world graphs. In Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, pages 311-320, 2005.
41. Adrian E. Raftery, Xiaoyue Niu, Peter D. Hoff, and Ka Yee Yeung. Fast inference for the latent space network model using a case-control approximate likelihood. Technical Report 572, Department of Statistics, University of Washington, 2010.
42. Everett Rogers. Diffusion of innovations. Free Press, 4th edition, 1995.
43. Purnamrita Sarkar, Deepayan Chakrabarti, and Andrew W. Moore. Theoretical justification of popular link prediction heuristics. In Proc. 23rd Conference on Learning Theory, pages 295-307, 2010.
44. Purnamrita Sarkar and Anrew W. Moore. Dynamic social network analysis using latent space models. In Proc. 17th Advances in Neural Information Processing Systems, 2005.
45. Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, 2007.
46. Michael F. Schwartz and David C. M. Wood. Discovering shared interests using graph analysis. Communications of the ACM, 36(8):78-89, 1993.
47. Michael Schweinberger and Tom A. B. Snijders. Settings in social networks: A measurement model. Sociological Methodology, 33:307-341, 2003.
48. Aleksandrs Slivkins. Distance estimation and object location via rings of neighbors. Distributed Computing, 19(4):313-333, March 2007. Special issue for 24th ACM PODC, 2005.
49. Aleksandrs Slivkins. Towards Fast Decentralized Construction of Locality-Aware Overlay Networks. In 26thACM Symp. on Principles of Distributed Computing, pages 89-98, 2007.
50. Tom A. B. Snijders. Statistical models for social networks. Annual Review of Sociology, 37:129-151, 2011.
51. Micheal Szell, Renaud Lambiotte, and Stefan Thurner. Multi-relational organization of large-scale social networks in an online world. Proc. Natl. Acad. Sci. USA, 107:13636-13641, 2010.
52. Lei Tang and Huan Liu. Relational learning via latent social dimensions. In Proc. 15th Intl. Conf. on Knowledge Discovery and Data Mining, pages 817-826, 2009.
53. Duncan J. Watts, Peter S. Dodds, and Mark E. J. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.
54. Barry Wellman. Which types of ties and networks give what kinds of social support? Advances in Group Processes, 9:207-235, 1992.
55. Barry Wellman and Scot Wortley. Different strokes from different folks: Community ties and social support. American Journal of Sociology, 96:558-588, 1990.