Tracing information flow on a global scale using Internet chain-letter data

  1. David Liben-Nowell*, and
  2. Jon Kleinberg,
  1. *Department of Computer Science, Carleton College, Northfield, MN 55057; and
  2. Department of Computer Science, Cornell University, Ithaca, NY 14853
  1. Edited by Ronald L. Graham, University of California at San Diego, La Jolla, CA, and approved January 25, 2008 (received for review September 6, 2007)

Abstract

Although information, news, and opinions continuously circulate in the worldwide social network, the actual mechanics of how any single piece of information spreads on a global scale have been a mystery. Here, we trace such information-spreading processes at a person-by-person level using methods to reconstruct the propagation of massively circulated Internet chain letters. We find that rather than fanning out widely, reaching many people in very few steps according to “small-world” principles, the progress of these chain letters proceeds in a narrow but very deep tree-like pattern, continuing for several hundred steps. This suggests a new and more complex picture for the spread of information through a social network. We describe a probabilistic model based on network clustering and asynchronous response times that produces trees with this characteristic structure on social-network data.

Footnotes

  • To whom correspondence may be addressed. E-mail: dlibenno{at}carleton.edu or kleinber{at}cs.cornell.edu
  • Author contributions: D.L.-N. and J.K. designed research, performed research, contributed new reagents/analytic tools, analyzed data, and wrote the paper.

  • The authors declare no conflict of interest.

  • This article is a PNAS Direct Submission.

  • This article contains supporting information online at www.pnas.org/cgi/content/full/0708471105/DC1.

  • Freely available online through the PNAS open access option.

« Previous | Next Article »Table of Contents
OPEN ACCESS ARTICLE