Abstract
While direct social ties have been intensely studied in the context of computer-mediated social networks, indirect ties (e.g., friends of friends) have seen little attention. Yet in real life, we often rely on friends of our friends for recommendations, introductions, and other occasional needs. In this work, we quantify the strength of indirect social ties, validate the metric, and demonstrate its usefulness for distributed applications. We show that our metric for social strength can alleviate problems in friend-to-friend storage systems and predict social diffusion with up to 93.5% accuracy.
Introduction
Most research into social networks focuses on direct ties—the people you know personally. However, in the real world, we frequently rely on indirect ties (friends of friends) for job referrals, doctor recommendations, or introductions. In the digital realm, distributed applications like "Friend-to-Friend" (F2F) storage systems often struggle because direct friend circles are too small or because friends have highly synchronized schedules. The challenge lies in identifying which indirect ties are "strong" enough to be useful. This paper addresses the need for a mathematically rigorous way to quantify the social strength of these often-ignored connections.
Quantifying Social Strength
The authors propose a new metric called Social Strength ($SS_n$). Unlike traditional metrics that treat relationships as binary, this approach treats the social graph as a weighted, directed network.
Key features of the $SS_n$ metric include:
- Asymmetry: Recognizing that Alice might value her tie to Bob more than Bob values his tie to Alice.
- The Weakest Link Principle: The strength of an indirect path is limited by its weakest direct connection.
- Path Redundancy: Multiple 2-hop or 3-hop paths between individuals increase the social tie strength.
- Distance Decay: Strength naturally diminishes as the number of "hops" increases.
- Normalization: Direct tie strength is calculated by normalizing a user's interactions with a specific friend against their total interactions.
Datasets and Validation
The study validates the metric using three real-world datasets:
- CA-I & CA-II: Academic co-authorship networks from ArnetMiner.
- TF2: Gameplay logs and social data from Team Fortress 2 and the Steam Community. This dataset provides high-resolution data on user availability.
The proposed metric showed a significantly higher correlation with actual interaction frequency than standard neighborhood-based metrics (like the Jaccard coefficient), especially in the gaming dataset.
Applications: Improving Distributed Systems
One of the primary applications of this metric is in Friend-to-Friend (F2F) storage. Direct friends often have synchronized "online" times, meaning they are all unavailable at the same time (e.g., during nighttime in a specific time zone).
By using the social strength metric to recruit storage candidates from 2-hop and 3-hop neighborhoods, the authors improved the online availability of storage resources by up to 20%. Indirect ties are more likely to have diverse schedules, effectively filling the gaps in data availability. Furthermore, the metric predicted information dissemination paths 2–3 steps ahead with an accuracy of up to 93.5%.
Conclusion
This work demonstrates that indirect social ties, when properly quantified, are a powerful resource for distributed applications. While privacy and security implications of trusting indirect ties require further study, the $SS_n$ metric provides a robust foundation for leveraging the "friend of a friend" network to improve system reliability and predictive modeling.
Summary updated