+ Reply to Thread
Results 1 to 4 of 4

Thread: Probability & Network Theory

  1. #1
    Points: 16, Level: 1
    Level completed: 31%, Points required for next Level: 34

    Posts
    3
    Thanks
    1
    Thanked 0 Times in 0 Posts

    Probability & Network Theory




    Hey Everyone,

    new to this forum and studying network/graph theory on my own. Math has never been my strong point, and I need help with how the author came to this equation:

    Imagine a network of people. Suppose that for some small probability p, each common friend that two people have gives them an independent probability p of forming a link each day. So if two people have k friends in common, the probability they fail to form a link on any given day is (1 - p)^k: this is because each common friend fails to cause the link to form with probability 1 - p, and these k trials are independent. Since (1 - p)^k is the probability the link fails to form on a given day, the probability that it does form, according to our simple baseline model, is : Tbaseline(k) = 1 - (1 - p)^k.

    Why isn't it p^k if p is the probability of a link forming and k is # common friends?

  2. #2
    TS Contributor
    Points: 6,786, Level: 54
    Level completed: 18%, Points required for next Level: 164

    Location
    Sweden
    Posts
    524
    Thanks
    44
    Thanked 112 Times in 100 Posts

    Re: Probability & Network Theory

    p^k is the probability that a link is created with all of the k common friends. The probability of k equally probable independent events to occur is p_1p_2p_3...p_k, and the probability of the occurance of none of these events are therefore (1-p_1)(1-p_2)(1-p_3)...(1-p_k)=(1-p)^k. And now to the probability of forming at least one link, well thats just the complement to the probability of not forming a link at all: 1-(1-p)^k.

    I don't know if this made it any clearer, but I hope so

  3. The Following User Says Thank You to Englund For This Useful Post:

    jwu013 (08-22-2015)

  4. #3
    Points: 16, Level: 1
    Level completed: 31%, Points required for next Level: 34

    Posts
    3
    Thanks
    1
    Thanked 0 Times in 0 Posts

    Re: Probability & Network Theory

    thank you Englund!

  5. #4
    Points: 16, Level: 1
    Level completed: 31%, Points required for next Level: 34

    Posts
    3
    Thanks
    1
    Thanked 0 Times in 0 Posts

    Re: Probability & Network Theory


    Englund: I think I was able to work it out. Let's say p of a link forming is .3 and 1-p is .7. Number of common friends k =3.

    Using the at least one rule: 1 - (1 - .3)^3 = .6570

    If I do this the long way it should be:

    .3(.7)(.7) = .1470 * 3 = .4410
    .3(.3)(.7) = .0630 * 3 = .1890
    (.3)(.3)(.3) = .0270
    .0270 + .4410 + .1890 = .6570

    Can you verify if my math and logic is correct? Just wanted to understand more about the 'at least one' rule

+ Reply to Thread

           




Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts






Advertise on Talk Stats