Class 10: Configuration Model

แชร์
ฝัง
  • เผยแพร่เมื่อ 19 ธ.ค. 2024

ความคิดเห็น •

  • @sohamdhodapkar3212
    @sohamdhodapkar3212 2 ปีที่แล้ว

    @jruths Super helpful video! Is it true that in a configuration model, in the large N-limit, all networks with given degree sequence are sampled approximately uniformly?

  • @siamakabdi7248
    @siamakabdi7248 2 ปีที่แล้ว

    Thanks for the video. Just, I have a question. Is the expression Sig(k^2*Pk) equal to at the end of the video?

  • @SitDownMr
    @SitDownMr 2 ปีที่แล้ว

    Hello thank you for the video, do you have the psuedocode for this model?

  • @tonywang7073
    @tonywang7073 4 ปีที่แล้ว

    Thank you! It's very helpful

  • @elturista000
    @elturista000 3 ปีที่แล้ว

    Thank you for your nice video. I have a question about the probability that two vertices are connected which you give a formula for p_{i,i} = k_i k_j/(2m-1), is it an approximation ? since if i take the degree distribution K = (3,3,1,1) the graph will have 4 edges, and the probability that node 1 and 2 connected is then p_{1,2} = (3 x 3) / 7 > 1, so it is not a probability.. The probability should simply gives 1. Am I mistaken?

    • @jruths
      @jruths 3 ปีที่แล้ว

      Ah - that degree sequence is not graphical - in a 4 node network if you have two nodes with degree 3, the other two nodes need to have at least degree 2 (making m=5). This would make the probability 3*3/(2*5-1) = 9/9.

  • @madisanz
    @madisanz 4 ปีที่แล้ว

    Hi! i have one question, this model is the same that Chung-Lu Model?

    • @justinruths9590
      @justinruths9590  4 ปีที่แล้ว

      They are quite similar. This writeup has a nice description of the differences (see page 11): tuvalu.santafe.edu/~aaronc/courses/3352/csci3352_2019_L3.pdf