Predicting tie strength with social media
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Faceted identity, faceted lives: social and technical issues with being yourself online
Proceedings of the ACM 2011 conference on Computer supported cooperative work
It's complicated: how romantic partners use facebook
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Characterizing and curating conversation threads: expansion, focus, volume, re-entry
Proceedings of the sixth ACM international conference on Web search and data mining
Mining smartphone data to classify life-facets of social relationships
Proceedings of the 2013 conference on Computer supported cooperative work
| Hi-index | 0.00 |
A crucial task in the analysis of on-line social-networking systems is to identify important people --- those linked by strong social ties --- within an individual's network neighborhood. Here we investigate this question for a particular category of strong ties, those involving spouses or romantic partners. We organize our analysis around a basic question: given all the connections among a person's friends, can you recognize his or her romantic partner from the network structure alone? Using data from a large sample of Facebook users, we find that this task can be accomplished with high accuracy, but doing so requires the development of a new measure of tie strength that we term `dispersion' --- the extent to which two people's mutual friends are not themselves well-connected. The results offer methods for identifying types of structurally significant people in on-line applications, and suggest a potential expansion of existing theories of tie strength.