skip to main content
10.1145/1298306.1298311acmconferencesArticle/Chapter ViewAbstractPublication PagesimcConference Proceedingsconference-collections
Article

Measurement and analysis of online social networks

Authors Info & Claims
Published:24 October 2007Publication History

ABSTRACT

Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks.

This paper presents a large-scale measurement study and analysis of the structure of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network's graph. Our data set contains over 11.3 million users and 328 million links. We believe that this is the first study to examine multiple online social networks at scale.

Our results confirm the power-law, small-world, and scale-free properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks contain a densely connected core of high-degree nodes; and that this core links small groups of strongly clustered, low-degree nodes at the fringes of the network. Finally, we discuss the implications of these structural properties for the design of social network based systems.

References

  1. Stanford WebBase Project. http://www-diglib.stanford.edu/~testbed/doc2/WebBase.Google ScholarGoogle Scholar
  2. L. A. Adamic. The Small World Web. In Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries (ECDL'99), Paris, France, Sep 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. A. Adamic, O. Buyukkokten, and E. Adar. A social network caught in the Web. First Monday, 8(6), 2003.Google ScholarGoogle Scholar
  4. Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. Analysis of Topological Characteristics of Huge Online Social Networking Services. In Proceedings of the 16th international conference on World Wide Web (WWW'07), Banff, Canada, May 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Albert, H. Jeong, and A.-L. Barábási. The Diameter of the World Wide Web. Nature, 401:130, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  6. L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences (PNAS), 97:11149--11152, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. Awan, R. A. Ferreira, S. Jagannathan, and A. Grama. Distributed uniform sampling in real-world networks. Technical Report CSD-TR-04-029, Purdue University, 2004.Google ScholarGoogle Scholar
  8. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group Formation in Large Social Networks: Membership, Growth, and Evolution. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), Philadelphia, PA, Aug 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A.-L. Barábási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509--512, 1999.Google ScholarGoogle Scholar
  10. L. Becchetti, C. Castillo, D. Donato, and A. Fazzone. A Comparison of Sampling Techniques for Web Graph Characterization. In Proceedings of the Workshop on Link Analysis (LinkKDD'06), Philadelphia, PA, Aug 2006.Google ScholarGoogle Scholar
  11. V. Braitenberg and A. Schüz. Anatomy of a Cortex: Statistics and Geometry. Springer-Verlag, Berlin, 1991.Google ScholarGoogle Scholar
  12. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph Structure in the Web: Experiments and Models. In Proceedings of the 9th International World Wide Web Conference (WWW'00), Amsterdam, May 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data, Jun 2007. http://arxiv.org/abs/0706.1062v1.Google ScholarGoogle Scholar
  14. d. boyd. Friends, Friendsters, and Top 8: Writing community into being on social network sites. First Monday, 11(12), 2006.Google ScholarGoogle Scholar
  15. P. Erdös and A. Rényi. On Random Graphs I. Publicationes Mathematicae Debrecen, 5:290--297, 1959.Google ScholarGoogle Scholar
  16. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law Relationships of the Internet Topology. In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM'99), Cambridge, MA, Aug 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Garriss, M. Kaminsky, M. J. Freedman, B. Karp, D. Mazières, and H. Yu. Re: Reliable Email. In Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI'06), San Jose, CA, May 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences (PNAS), 99:7821--7826, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  19. Google Co-op. http://www.google.com/coop/.Google ScholarGoogle Scholar
  20. M. Granovetter. The Strength of Weak Ties. American Journal of Sociology, 78(6), 1973.Google ScholarGoogle ScholarCross RefCross Ref
  21. J. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 46:604--632, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Kleinberg. Navigation in a Small World. Nature, 406:845--845, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  23. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC'00), Portland, OR, May 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. J. Kleinberg and S. Lawrence. The Structure of the Web. Science, 294:1849--1850, 2001.Google ScholarGoogle Scholar
  25. J. M. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In IEEE Symposium on Foundations of Computer Science (FOCS'96), Burlington, VT, Oct 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. R. Kumar, J. Novak, and A. Tomkins. Structure and Evolution of Online Social Networks. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), Philadelphia, PA, Aug 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for Emerging Cyber-Communities. Computer Networks, 31:1481--1493, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Lee, R. Sherwood, and B. Bhattacharjee. Cooperative peer groups in NICE. In Proceedings of the Conference on Computer Communications (INFOCOM'03), San Francisco, CA, Mar 2003.Google ScholarGoogle ScholarCross RefCross Ref
  29. S. H. Lee, P.-J. Kim, and H. Jeong. Statistical properties of sampled networks. Physical Review E, 73, 2006.Google ScholarGoogle Scholar
  30. L. Li and D. Alderson. Diversity of graphs with highly variable connectivity. Physics Review E, 75, 2007.Google ScholarGoogle Scholar
  31. L. Li, D. Alderson, J. C. Doyle, and W. Willinger. Towards a Theory of Scale-Free Graphs: Definitions, Properties, and Implications. Internet Mathematics, 2(4):431--523, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  32. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic Routing in Social Networks. Proceedings of the National Academy of Sciences (PNAS), 102(33):11623--11628, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  33. P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat. Systematic Topology Analysis and Generation Using Degree Correlations. In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM'06), Pisa, Italy, August 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. S. Milgram. The small world problem. Psychology Today, 2(60), 1967.Google ScholarGoogle Scholar
  35. A. Mislove, K. P. Gummadi, and P. Druschel. Exploiting social networks for Internet search. In Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets-V), Irvine, CA, Nov 2006.Google ScholarGoogle Scholar
  36. M. Molloy and B. Reed. A critical point for random graphs with a given degree distribution. Random Structures and Algorithms, 6, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combinatorics, Probability and Computing, 7, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. R. Morselli, B. Bhattacharjee, J. Katz, and M. A. Marsh. Keychains: A Decentralized Public-Key Infrastructure. Technical Report CS-TR-4788, University of Maryland, 2006.Google ScholarGoogle Scholar
  39. MozillaCoop. http://www.mozilla.com.Google ScholarGoogle Scholar
  40. MySpace is the number one website in the U.S. according to Hitwise. HitWise Press Release, July, 11, 2006. http://www.hitwise.com/press-center/hitwiseHS2004/social-networking-june-2006.php.Google ScholarGoogle Scholar
  41. M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences (PNAS), 98:409--415, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  42. M. E. J. Newman. Mixing patterns in networks. Physics Review E, 67, 2003.Google ScholarGoogle Scholar
  43. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford University, 1998.Google ScholarGoogle Scholar
  44. PayPerPost. http://www. payperpost.com.Google ScholarGoogle Scholar
  45. A. G. Phadke and J. S. Thorp. Computer relaying for power systems. John Wiley & Sons, Inc., New York, NY, USA, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. I. Pool and M. Kochen. Contacts and influence. Social Networks, 1:1--48, 1978.Google ScholarGoogle ScholarCross RefCross Ref
  47. D. Rezner. The Power and Politics of Weblogs. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW'04), Chicago, IL, Nov 2004.Google ScholarGoogle Scholar
  48. G. Siganos, S. L. Tauro, and M. Faloutsos. Jellyfish: A Conceptual Model for the AS Internet Topology. Journal of Communications and Networks, 8(3):339--350, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  49. Skype. http://www.skype.com.Google ScholarGoogle Scholar
  50. StumbleUpon. http://www.stumbleupon.com.Google ScholarGoogle Scholar
  51. S. Wasserman and K. Faust. Social Networks Analysis: Methods and Applications. Cambridge University Press, Cambridge, UK, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  52. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440--442, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  53. W. Willinger, D. Alderson, and L. Li. A pragmatic approach to dealing with high-variability in network measurements. In Proceedings of the 2nd ACM/Usenix Internet Measurement Conference (IMC'04), Taormina, Italy, Oct 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Yahoo! MyWeb. http://myweb2.search.yahoo.com.Google ScholarGoogle Scholar
  55. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. SybilGuard: Defending against Sybil attacks via social networks. In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM'06), Pisa, Italy, August 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Measurement and analysis of online social networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          IMC '07: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
          October 2007
          390 pages
          ISBN:9781595939081
          DOI:10.1145/1298306

          Copyright © 2007 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 24 October 2007

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate277of1,083submissions,26%

          Upcoming Conference

          IMC '24
          ACM Internet Measurement Conference
          November 4 - 6, 2024
          Madrid , AA , Spain

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader