3.57 degrees of separation

3.57
degrees of separation
Smaller than we think
Our new figure
Not six
but less
three point five seven
should be a new play
extensively studied
small world
100 friends
each of his friends
has 100 friends
then the number of friends-of-friends
Then mega overlap
and "magic"
unique connections
statistical algorithms
developed
approximate number 3.57
Hops away from each other..
Don’t be scared
you probably knew this
already Dear Friends
Like 0 Pin it 0
Support CosmoFunnel.com
You can help support the upkeep of CosmoFunnel.com via PayPal.
Comments
Calculating degrees-of-separation at scale
Calculating degrees of separation in a network with hundreds of billions of edges is a monumental task, because the number of people reached grows very quickly with the degree of separation.
Imagine a person with 100 friends. If each of his friends also has 100 friends, then the number of friends-of-friends will be 10,000. If each of those friends-of-friends also has 100 friends then the number of friends-of-friends-of-friends will be 1,000,000. Some of those friends may overlap, so we need to filter down to the unique connections. We're only two hops away and the number is already big. In reality this number grows even faster since most people on Facebook have more than 100 friends. We also need to do this computation 1.6 billion times; that is, for every person on Facebook.
Rather than calculate it exactly, we relied on statistical algorithms developed by Kang and others [6-8] to estimate distances with great accuracy, basically finding the approximate number of people within 1, 2, 3 (and so on) hops away from a source.
More accurately, for each number of hops we estimate the number of distinct people you can reach from every source. This estimation can be done efficiently using the Flajolet-Martin algorithm [9]. How does it work? Imagine you have a set of people and you want to count how many are unique. First you assign each person a random integer; let's call it hash. Approximately 1/2 of the people will have an even hash: the binary representation of the hash will end with 0. Approximately 1/4 of the people will have a hash divisible by 4; that is, the binary representation ends with 00. In general, 1/2n people will have the binary representation of their hash end with n zeros. Now, we can reverse this and try to count how many different people we have by reading their hash values one by one. To do that, we track the biggest number of zeroes we've seen. Intuitively, if there were n zeroes, we can expect set to have c*2n unique numbers, where c is some constant. For better accuracy we can do this computation multiple times with different hash values.
This algorithm maps well to our problem: you just find the biggest number of zeroes among all friends' hashes. By using a bitwise OR operation on the hash, this process can be repeated recursively to estimate the number of unique friends-of-friends, and then friends-of-friends-of-friends. We used Apache Giraph [10] to run this computation on the entire Facebook friendship graph. In our implementation, at each step each person sends a bitwise ORed hash value to all his friends. We do this recursively and use Flajolet-Martin's math to estimate the number of unique friends for each degree of separation.
In summary, we find that the world is more closely connected than you might think.
Hi Mark enjoyed working through your calculations I`m
a one and one is two type of girl but solved your mathematical
poem lol really enjoyed.. Regards Debs
deborah --glad you enjoyed