The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Predicting tie strength with social media
Abstract
Social media treats all users the same: trusted friend or total stranger, with little or nothing in between. In reality, relationships fall everywhere along this spectrum, a topic social science has investigated for decades under the theme of tie strength. Our work bridges this gap between theory and practice. In this paper, we present a predictive model that maps social media data to tie strength. The model builds on a dataset of over 2,000 social media ties and performs quite well, distinguishing between strong and weak ties with over 85% accuracy. We complement these quantitative findings with interviews that unpack the relationships we could not predict. The paper concludes by illustrating how modeling tie strength can improve social media design elements, including privacy controls, message routing, friend introductions and information prioritization.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The accuracy of the formula in predicting the strength of the social network was increased by the factors of structural and social distance, which removed emotional support from predictive intensity and treated it as an independent factor so that users' invisible backgrounds could be taken into account [19,65].”
In the citing paper
“the type and the dynamics of offline relationships influence users propensity to create social ties and interact online”
From Social Data: Biases, Methodological Pitfalls, and Ethical Boundaries (2019) · cites this paper as Gilbert and Karahalios, 2009
Citations
Cites
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Strength of Weak Ties: A Network Theory Revisited
Granovetter, M. (1983) · Sociological Theory · doi:10.2307/202051 · Cited by 8,263
Structural Holes: The Social Structure of Competition
Lazega, E., & Burt, R. S. (1995) · Revue Française de Sociologie · doi:10.2307/3322456 · Cited by 7,853
The Search-Transfer Problem: The Role of Weak Ties in Sharing Knowledge across Organization Subunits
Hansen, M. T. (1999) · Administrative Science Quarterly · doi:10.2307/2667032 · Cited by 5,809 · cited 1×
“They also expedite the transfer of knowledge across workgroups [20].”
BackgroundStructural Holes and Good Ideas
Burt, R. S. (2004) · American Journal of Sociology · doi:10.1086/421787 · Cited by 5,642
Getting a Job: A Study of Contacts and Careers.
Hallinan, M. T., & Granovetter, M. S. (1975) · Contemporary Sociology · doi:10.2307/2063210 · Cited by 3,613
Networks and Organizations: Structure, Form, and Action.
Kadushin, C., Nohria, N., & Eccles, R. G. (1994) · Contemporary Sociology · doi:10.2307/2075362 · Cited by 3,219
Friends and neighbors on the Web
Adamic, L. A., & Adar, E. (2003) · Social Networks · doi:10.1016/s0378-8733(03)00009-1 · Cited by 2,954
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
Research works printed but not linked: 6
- Google Scholar. (http://scholar.google.com/scholar?q=weak+ties. Accessed September 16 2008. Google Scholar. (http://scholar.google.com/scholar?q=weak+ties. Accessed September 16 2008.
- Greasemonkey . http://www.greasespot.net. Accessed September 16, 2008 . Greasemonkey. http://www.greasespot.net. Accessed September 16, 2008.
- 10.1002/(sici)1097-4571(1998)49:12%3c1101::aid-asi6%3e3.3.co;2-s · doi:10.1002/(sici)1097-4571(1998)49:12<1101::aid-asi6>3.3.co;2-s
- Pennebaker , J. W. and Francis , M. E . Linguistic Inquiry and Word Count . Lawrence Erlbaum , 1999 . Pennebaker, J. W. and Francis, M. E. Linguistic Inquiry and Word Count. Lawrence Erlbaum, 1999.
- Rapleaf . RapLeaf Study of Social Network Users vs. Age. http://business.rapleaf.com/company_press_2008_(06_18.html . Accessed September 16, 2008 . Rapleaf. RapLeaf Study of Social Network Users vs. Age. http://business.rapleaf.com/company_press_2008_(06_18.html. Accessed September 16, 2008.
- 10.2307/2657252 · doi:10.2307/2657252 · Paper page
Cited by
Moorhead, S. A., Hazlett, D. E., Harrison, L., Carroll, J. K., Irwin, A., & Hoving, C. (2013) · Journal of Medical Internet Research · doi:10.2196/jmir.1933 · Cited by 2,517
The role of social networks in information diffusion
Bakshy, E., Rosenn, I., Marlow, C., & Adamic, L. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187907 · Cited by 1,526
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
Hogan, B. (2010) · Bulletin of Science, Technology & Society · doi:10.1177/0270467610385893 · Cited by 1,318
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
Metadata
- Authors
- Gilbert, E., & Karahalios, K.
- Affiliations
- University of Illinois at Urbana-Champaign, Urbana, IL, USA
- University of Illinois Urbana-Champaign (US)
- ORCID
- Karahalios, Karrie
- Venue
- Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
- Publisher
- ACM
- Published
- 2009-04-04
- Pages
- 211-220
- OpenAlex
- W2124142520
- Cited by
- 1,382
- References
- 41
- Citations by year
- 2026: 11 · 2025: 25 · 2024: 21 · 2023: 21 · 2022: 40 · 2021: 70 · 2020: 74 · 2019: 88 · 2018: 112 · 2017: 141 · 2016: 113 · 2015: 124 · 2014: 131 · 2013: 148 · 2012: 123
- FWCI
- 86.21
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- CHI Conference on Human Factors in Computing Systems (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Data Mining
- Keywords
- tie strength, social media, strong and weak ties, relation prediction, social network analysis, social media design, privacy control, message routing, data prioritization
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predicting tie strength with social media. https://app.cochat.ai/papers/10.1145/1518701.1518736
- The paper
- Gilbert, E., & Karahalios, K. (2009). Predicting tie strength with social media. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. https://doi.org/10.1145/1518701.1518736
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.