Abstract
In this work, we consider the evolution of structure within large online social networks. We present a series of measurements of two large real networks, one from the friend relation within the Flickr photo sharing application and the other from Yahoo!s 360 social network. These networks together comprise in excess of 5 million people and 10 million friendship links, and they are annotated with metadata capturing the time of every event in the life of the network. We show that these networks may be segmented into three regions: singletons, who do not participate in the network, isolated communities, which overwhelmingly display star structure, and a giant component anchored by a well-connected core region that persists even in the absence of stars. We give a detailed characterization of the structure and evolution of these regions. We also present a simple model of network growth that captures these aspects of component structure. The model follows our experimental results, characterizing users as either passive members of the network, inviters who encourage offline friends and acquaintances to migrate online, and linkers who fully participate in the social evolution of the network. We show that this simple model with only two numerical parameters is able to produce synthetic networks that accurately reflect the structure of both our real-world networks.
Most of this work appeared in the Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining, pp. 611–617, 2006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
L. A. Adamic and E. Adar. How to search a social network. Social Networks, 27(3):187–203, 2005.
R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74: 47, 2002.
R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, 401:130–131, 1999.
A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509–512, 1999.
B. Bollobás. A probabilistic proof of an asymptotic formula for the number of labeled regular graphs. European Journal of Combinatorics, 1:311–316, 1980.
B. Bollobas. Random Graphs. Cambridge University Press, Cambridge, UK, 2001.
B. Bollobas and O. Riordan. Mathematical results on scale-free random graphs, In S. Bornholdt and H. G. Schuster, editors, Handbook of Graphs and Networks, pages 1–34. Wiley-VCH, Weinheim, Germany, 2002.
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener. Graph structure in the web. WWW9/Computer Networks, 33(1–6):309–320, 2000.
P. S. Dodds, R. Muhamad, and D. J. Watts. An experimental study of search in global social networks. Science, 301:827–829, 2003.
S. Dorogovtsev and J. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford, England, 2000.
S. Dorogovtsev and J. Mendes. Evolution of networks. Advances in Physics, 51:1079–1187, 2002.
P. Erdös and A. Rényi. On random graphs I. Publications Mathematics Debrecen, 6:290–297, 1959.
M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proceedings of ACM SIGCOMM Conference, pages 251–262, Cambridge, MA, Aug 1999.
D. Fetterly, M. Manasse, M. Najork, and J. Wiener. A large-scale study of the evolution of web pages. Software Practice and Experience, 34(2):213–237, 2004.
J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 163–170, Portland, OR, May 2000.
J. Kleinberg. Complex networks and decentralized search algorithms. In Proceedings of the International Congress of Mathematicians, pages 1019–1044, Madrid, Spain, Aug 2006.
J. M. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
R. Kumar, J. Novak, P. Raghavan, and A. Tomkins. Structure and evolution of blogspace. Communications of the ACM, 47(12):35–39, 2004.
R. Kumar, J. Novak, P. Raghavan, and A. Tomkins. On the bursty evolution of blogspace. World Wide Web Journal, 8(2):159–178, 2005.
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proceedings of 41st Annual Symposium on Foundations of Computer Science, pages 57–65, Redondo Beach, CA, Nov 2000.
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. WWW8/Computer Networks, pages 1481–1493, Toronto, Canada, May 1999.
J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In Proceedings of the 14th ACM International Conference on Knowledge Discovery and Data Mining, pages 462–470, Las Vegas, NV, Aug 2008.
J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters, and possible explanations. In Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining, pages 177–187, Chicago, IL, Aug 2005.
J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Statistical properties of community structure in large social and information networks. In Proceedings of the 17th International Conference on World Wide Web, pages 695–704, Beijing, China, Apr 2008.
D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic routing in social networks. Proceedings of the National Academy of Sciences, 102(33):11623–11628, 2005.
M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161–180, 1995.
M. Newman. The structure and function of complex networks. SIAM Review, 45:167–256, 2003.
M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64(2):026118(17 pages), 2001.
A. Ntoulas, J. Cho, and C. Olston. What’s new on the web? the evolution of the web from a search engine perspective. In Proceedings of the 13th International Conference on World Wide Web, pages 1–12, New York, NY, May 2004.
S. Strogatz. Exploring complex networks. Nature, 410:268–276, 2001.
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, UK, 1994. Revised, reprinted edition, 1997.
D. J. Watts and S. H. Strogatz. Collective dynamics of ‘small-world’ networks. Nature, 393:440–442, 1998.
Acknowledgements
We are grateful to the Flickr and Yahoo! 360 teams at Yahoo! for their support in data gathering, data analysis, and direction. In particular, we would like to thank Stewart Butterfield, Catarina Fake, Serguei Mourachov, and Neal Sample.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Kumar, R., Novak, J., Tomkins, A. (2010). Structure and Evolution of Online Social Networks. In: Yu, P., Han, J., Faloutsos, C. (eds) Link Mining: Models, Algorithms, and Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-6515-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6515-8_13
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-6514-1
Online ISBN: 978-1-4419-6515-8
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)