The structure of information pathways in a social communication network

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 435-443

  Kossinets, Gueorgi ^a   Kleinberg, Jon ^b   Watts, Duncan ^c  

^a Department of Obstetrics Gynecology   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

Communication latency; Social network; Strength of weak ties

Indexed keywords

COMMUNICATION LATENCY; CONCENTRATION OF; DISTRIBUTED COMPUTING SYSTEMS; E-MAIL COMMUNICATIONS; MINIMUM-TIME; NETWORK BACKBONES; ON-LINE DATUM; SOCIAL COMMUNICATION NETWORKS; SOCIAL NETWORK; SPARSE GRAPHS; STRENGTH OF WEAK TIES; STRUCTURAL INSIGHTS; SUBGRAPH; TEMPORAL DYNAMICS;

COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; INFORMATION MANAGEMENT; MINING;

COMMUNICATION;

EID: 65449153304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401945     Document Type: Conference Paper

References (32)

1. L. Adamic and E. Adar. How to search a social network. Social Networks, 27(3): 187-203, 2005.
2. L. A. Adamic, B. A. Huberman. Information dynamics in the networked world. Springer Lee. Notes. Phys. 650(2004).
3. E. Adar, L. Zhang, L. A. Adamic, and R. M. Lukose. Implicit structure and the dynamics of blogspace. In Workshop on the Weblogging Ecosystem, 2004.
4. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance in complex networks. Nature, 406:378-382, 2000.
5. K. Berman. Vulnerability of scheduled networks and a generalization of Menger's theorem. Networks, 28(1996).
6. E. Cheng, J. W. Grossman, and M. J. Lipman. Time-stamped graphs and their associated influence digraphs. Discrete Applied Mathematics, 128:317-335, 2003.
7. A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. E. Sturgis, D. C. Swinehart, D. B. Terry. Epidemic algorithms for replicated database maintenance. Proc. 6th ACM Symp. Principles of Distributed Comp., 1987.
8. P. Dodds, R. Muhamad, and D. Watts. An experimental study of search in global social networks. Science, 301(2003).
9. J.-P. Eckmann, E. Moses, and D. Sergi. Entropy of dialogues creates coherent structures in e-mail traffic. Proc. Natl. Acad. Sci. USA, 101:14333-14337,2004.
10. D. Gibson. Concurrency and commitment: Network scheduling and its consequences for diffusion. Journal of Mathematical Sociology, 29(4):295-323, 2005.
11. M. Granovetter. The strength of weak ties. American Journal of Sociology, 78:1360-1380, 1973.
12. M. Granovetter. The strength of weak ties: A network theory revisited. Sociological Theory, 1:201-233, 1983.
13. D. Gruhl, D. Liben-Nowell, R. V. Guha, and A. Tomkins. Information diffusion through blogspace. In Proc. 13th International World Wide Web Conference, 2004.
14. P. Holme. Network reachability of real-world contact sequences. Physical Review E, 71:046119, 2005.
15. D. Kempe, J. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In Proc. 32nd ACM Symp. on Theory of Computing, pages 504-513, 2000.
16. B. Klimt and Y. Yang. The Enron corpus: A new dataset for email classification research. In Proc. 15th European Conference on Machine Learning, pages 217-226, 2004.
17. G. Kossinets. Effects of missing data in social, networks. Social Networks, 28:247-268, 2006.
18. G. Kossinets and D. Watts. Empirical analysis of an evolving social network. Science, 311:88-90, 2006.
19. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Comm. ACM, 21(7):558-565, 1978.
20. E. Laumann, P. Marsden, D. Prensky. The boundary specification problem in network analysis. In R. S. Burt and M. J. Minor, editors, Applied Network Analysis, 1983.
21. J. Leskovec, L. Adamic, B. Huberman. The dynamics of viral marketing. Proc. 7th ACM Conf. Elec. Commerce, 2006.
22. J. Leskovec and E. Horvitz. Worldwide buzz: Planetary-scale views on an instant-messaging network. In Proc. 17th International World Wide Web Conference, 2008.
23. J. Leskovec, M. McGlohon, C. Faloutsos, N. Glance, and M. Hurst. Cascading behavior in large blog graphs. In Proc. SIAM International Conference on Data Mining, 2007.
24. D. Liben-Nowell and J. Kleinberg. Tracing information flow on a global scale using Internet chain-letter data. Proc. Natl. Acad. Sci. USA, 105(12):4633-4638, Mar. 2008.
25. F. Mattern. Virtual time and global states of distributed systems. Workshop on Parallel and Distributed Algs. 1989.
26. V. Nabokov. The Gift. (English translation by M. Scammel and V. Nabokov.) Vintage, 1963.
27. J.-P. Onnela, J. Saramaki, J. Hyvonen, G. Szabo, D. Lazer, K. Kaski, J. Kertesz, and A.-L. Barabasi. Structure and tie strengths in mobile communication networks. Proc. Natl. Acad. Sci. USA, 104:7332-7336, 2007.
28. E. F. Taylor and J. A. Wheeler. Spacetime Physics: Introduction to Special Relativity. W.H. Freeman, 1992.
29. J. Travers and S. Milgram. An experimental study of the small world problem. Sociometry, 32(4):425-443, 1969.
30. D. J. Watts. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton U. Press, 1999.
31. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.
32. H. C. White. Everyday life in stochastic networks. Sociological Inquiry, 43:43-49, 1973.