-
Notifications
You must be signed in to change notification settings - Fork 0
/
exp.Rmd
40 lines (26 loc) · 1.59 KB
/
exp.Rmd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
---
title: "Explanation of Dispersion"
author: "Han Zhang"
date: "March 12, 2015"
output: html_document
---
<img src="1.jpg" />
<br >
<img src="2.jpg" />
The goal is that, given a person $U$, we want to find whether an friend of $U$ is his/her romantic partner.
We can predict whether $U$ and a friend $V$ is romantic partner based on embeddedness, defined as the number of common friends between $U$ and $V$.
Then, given $u$
- in the first plot, embeddedness between $U$ and $B$ is 5 (yellow nodes are common friends)
- in the second plot, embeddedness between $U$ and $H$ is 4 (yellow nodes are common friends)
We will think that $U$ and $B$ will be more likely to be partner than with $H$. But we may actually see that $U$ and $B$ are in the same foci, which makes them have more common friends.
So Backstrom and Kleinberg invented the idea of dispersion.
Dispersion, $disp(U,V)$: the set of all common friends of $U$ and $V$ is $C_{UV}$. (yellow nodes in the image!)
Then, for each pair of node $s,t$ in common neighbors
$$disp(U,V) = \sum_{s,t \in C_{UV}} d_{st}$$
$d_{st}$ is 1, if there is
1. No direct link betwen $s$ and $t$
2. No other common friends which is also $U$'s friend
or otherwise $d_{st}=0$, which suggest that $s,t$ may belong to the same foci and are not "dispersed".
- In the first plot, $disp(U,H)$=1: there is only one pair whose $d$ is 1: $(A,E)$.
- all other pairs, such as $(C,F)$ have common friend $D$ who is also $U$'s friend; $(F,E)$ are directly linked.
- In the second plot, $disp(U,H)$=4: there are four pairs whose $d$ is 1: $(F,K)$,$(F,J)$,$(C,J)$,$(C,K)$.