Social Network Friendship Paradox

Problem / Observation:

The friendship paradox is the phenomenon first observed by the sociologist Scott L. Feld in 1991 that most people have fewer friends than their friends have, on average. Prove it mathematically.


Update (23 Oct 2014):
Solution: Posted by Mike Earnest and Taz in comments!

Comments

  1. Mike Earnest8:21 PM, July 08, 2014

    If the friendship graph is (V,E), the average number of friends people have is

    (1/|V|) Sum_{v in V} deg v = 2|E| / |V|

    The average of the average number of friends people's friends have is

    (1/|V|) Sum_{v in V} [ (1/deg v) Sum_{w in v's friends} deg w ]

    = (1/|V|) Sum_{v,w in V, v friends with w} (deg w)/(deg v) (*)

    Consider the summation in (*). For each edge, with endpoints v and w, there are two terms, (deg v)/(deg w) and (deg w)/(deg v). Since a/b + b/a is always at least 2 (to prove this, start with (a - b)^2 >= 0), this implies that (*) is at least (1 / |V|)*2 |E|, completing the proof.

    ReplyDelete
    Replies
    1. Pratik Poddar4:29 PM, October 23, 2014

      Thanks Mike. This solution is so better than any explanation I have read elsewhere. Thanks.

      Delete
    2. Mike Earnest12:06 AM, October 24, 2014

      :D Thanks!

      Delete
  2. Taz12:23 AM, July 09, 2014

    The number of friends people have would not be a normal distribution rather it would be left skewed. So majority of people will have only a few friends while only a small number of people will have lots of friends.

    Thanks to this second group (people with lots of friends) are more likely to number in your friends list. When they are actually part of your friends list, they would significantly skew the average number of friends that your friends have. Hence, on average, your friends will have more friends than you.

    ReplyDelete

Post a Comment

Popular posts from this blog

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially) ...
Read more