The structure of information pathways in a social communication network
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dynamics of communication using on-line data, including e-mail communication among the faculty and staff of a large university over a two-year period. We formulate a temporal notion of "distance" in the underlying social network by measuring the minimum time required for information to spread from one node to another - a concept that draws on the notion of vector-clocks from the study of distributed computing systems. We find that such temporal measures provide structural insights that are not apparent from analyses of the pure social network topology. In particular, we define the network backbone to be the subgraph consisting of edges on which information has the potential to flow the quickest. We find that the backbone is a sparse graph with a concentration of both highly embedded edges and long-range bridges - a finding that sheds new light on the relationship between tie strength and connectivity in social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Self-citationGranovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Strength of Weak Ties: A Network Theory Revisited
Granovetter, M. (1983) · Sociological Theory · doi:10.2307/202051 · Cited by 8,263
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Small worlds: the dynamics of networks between order and randomness
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5722 · Cited by 2,360
Structure and tie strengths in mobile communication networks
Onnela, J.-P., Saramäki, J., Hyvönen, J., Szabó, G., Lazer, D., Kaski, K., Kertész, J., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610245104 · Cited by 1,926
An Experimental Study of the Small World Problem
Travers, J., & Milgram, S. (1969) · Sociometry · doi:10.2307/2786545 · Cited by 1,863
Empirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
Self-citation
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
“[98] define the ‘‘distance’’ between two vertices as the shortest duration of any time-respecting path between them.”
BackgroundDe-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
What's in a crowd? Analysis of face-to-face behavioral networks
Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F., & Van den Broeck, W. (2011) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2010.11.033 · Cited by 825
A measurement-driven analysis of information propagation in the flickr social network
Cha, M., Mislove, A., & Gummadi, K. P. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526806 · Cited by 768
Time-varying graphs and dynamic networks
Casteigts, A., Flocchini, P., Quattrociocchi, W., & Santoro, N. (2012) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760.2012.668546 · Cited by 592
Community Detection and Mining in Social Media
Tang, L., & Liu, H. (2010) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00298ed1v01y201009dmk003 · Cited by 352
K-isomorphism: privacy preserving network publication against structural attacks
Cheng, J., Fu, A. W.-C., & Liu, J. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807218 · Cited by 348
Social influence and the diffusion of user-created content
Bakshy, E., Karrer, B., & Adamic, L. A. (2009) · Proceedings of the 10th ACM conference on Electronic commerce · doi:10.1145/1566374.1566421 · Cited by 308
Temporal motifs in time-dependent networks
Kovanen, L., Karsai, M., Kaski, K., Kertész, J., & Saramäki, J. (2011) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2011/11/p11005 · Cited by 296
Graph Metrics for Temporal Networks
Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., & Latora, V. (2013) · Understanding Complex Systems · doi:10.1007/978-3-642-36461-7_2 · Cited by 269
Temporal dynamics and network analysis
Blonder, B., Wey, T. W., Dornhaus, A., James, R., & Sih, A. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00236.x · Cited by 254
How does the data sampling strategy impact the discovery of information diffusion in social media?
De Choudhury, M., Lin, Y.-R., Sundaram, H., Candan, K. S., Xie, L., & Kelliher, A. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14024 · Cited by 209
“…from recommendation systems, online advertising, user behavior prediction and disease containment (Kempe, Kleinberg, and Tardos 2003), (Gruhl et al. 2004), (Song et al. 2006), (Anagnostopoulos, Kumar, and Mahdian 2008), (Kossinets, Kleinberg, and Watts 2008), (Liben-Nowell and Kleiberg 2008).”
BackgroundThe role of hidden influentials in the diffusion of online information cascades
Baños, R. A., Borge-Holthoefer, J., & Moreno, Y. (2013) · EPJ Data Science · doi:10.1140/epjds18 · Cited by 79
Metadata
- Authors
- Kossinets, G., Kleinberg, J., & Watts, D.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 435-443
- OpenAlex
- W2125349172
- Cited by
- 332
- References
- 33
- FWCI
- 37.38
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.