4 Lerman
4 Lerman
4 Lerman
‡
Kristina Lerman
University of Southern California
Information Sciences Institute
4676 Admiralty Way
Marina del Rey, California 90292
[email protected]
highly unlikely.
100 Moreover, users digg stories submitted by their friends very
quickly. The heavy solid line in Figure 1(b) shows the number
10 of reverse friends who were among the first 25 diggers. The
probability that these numbers could have been observed by
chance is even less—P = 0.003. We conclude that users digg
1
stories their friends submit. A consequence of this conclusion
1 10 100 1,000
is that users with active and large social networks are more
number friends+1
successful in getting their stories promoted to the front page.
Fig. 1: Scatter plot of the number of friends vs reverse friends We believe that this explains the success of top users.
for the top 1020 Digg users. Two of the biggest celebrities,
kevinrose and diggnation, are marked a and b 3.2 Users digg stories their friends digg
Do social networks also help users discover interesting stories
that were submitted by unknown users? In other words, do
3. Social filtering on Digg users digg stories their friends like?
We looked at the 25 diggs that came after the first m diggs
To show that Digg users take advantage of the Friends inter- to see how many came from friends of the first m diggers.
face to filter the tremendous number of new submissions, we Of the stories posted posted by “unknown” users, ten were
analyze two sub-claims: (a) users digg stories their friends dugg by submitter’s reverse friends (p = 0.005). After five
submit, and (b) users digg stories their friends digg. more diggs (m = 6), 75 became visible to others through the
Note that the “friend” relationship is not symmetric: if user friends interface, and of these 23 (p = 0.028) were dugg by
A designates user B as a friend, user A can keep track of user friends. After 15 users dugg the story, 94 are now visible
B’s activities, but not vice versa. This makes A the reverse and 37 (p = 0.060) are dugg by friends. After 25 diggs, all
friend of B. Figure 1 shows the scatter plot of the number of 96 stories were visible, and almost half of these were dugg
friends vs reverse friends of the top 1020 Digg users as of May by friends (p = 0.077). The probabilities that these many
2006. Black symbols correspond to the top 33 users. For the friends could have dugg the story by chance are above the
most part, users appear to take advantage of Digg’s social 0.05 significance level for after 25 diggs, possibly reflecting
networking feature, with the top users having bigger social the story’s increased visibility on the front page. Although
networks. the effect is not quite as dramatic as one in the previous
section, we believe that the data shows that users do use the
3.1 Users digg stories their friends submit
friends interface to find new interesting stories.
We compare the list of users who dugg the story, or any por-
tion of it, with the list of reverse friends of the submitter. Sub-
mitter’s name is the first on the list. Figure 2 shows the num-
References
ber of diggers who are also among the reverse friends of the [1] J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker,
submitter. Dashed line shows the size of the social network L. R. Gordon, and J. Riedl. GroupLens: Applying
(number of reverse friends) of the submitter. More than half collaborative filtering to Usenet news. Communications
of the stories (102) were submitted by users with one or more of the ACM, 40(3):77–87, 1997.
reverse friends, and the rest by unknown users. We use simple [2] S. Perugini, M. Andr Gonalves, and E. A. Fox.
combinatorics to compute the probability that k of the sub- Recommender systems research: A connection-centric
mitter’s friends could have dugg the story purely by chance. survey. Journal of Intelligent Information Systems,
The probability that after picking n = 215 users randomly 23(2):107 – 143, September 2004.
from a pool of N = 15, 742 you end ` ´up with k that came
from a group of size K is P (k, n) = nk (p)k (1 − p)n−k , where
p = K/N . Using this formula, the probability (averaged over
stories dugg by at least one friend) that the observed numbers
of friends dugg the story by chance is P = 0.005, making it