1 |
Degrees of separation The shortest number of path links it takes to get from person (or node) X to person (or node) Y in a network. For example, if X knows A who knows B who knows Y, then X and Y have three degrees of separation (X to A, A to B, and B to Y). A study by Stanley Milgram in the 1950s testing how many links it took to connect a random mid-Westerner from O [..]
|
<< Check-writing organization | Directed social networks >> |