Glad you like the background music. That is something personal that is difficult to choose ;) The music is by Scott Holmes Music - New Beginnings and can be found here: freemusicarchive.org/music/Scott_Holmes/inspiring-background-music/new-beginnings/
You are absolutely right! 😄 The shortest route between nodes "a" and "e" should indeed be (a, d, e), as you pointed out in the video at 3:30. It appears that there was an error in the table. I apologize for this mistake, and thank you for noticing it. You are the first among the nearly 12,000 viewers who have watched this video since January 12, 2022, to have spotted this error. 🙌😊
Hi Utku, thanks for your comment. We like videos with background music. However, it is quite difficult to find the right music. We would love to hear your suggestions.
@@symbio6 I think the issue is not about the music you chose. I was not able to hear your voice because of the high volume of the music. Thanks for your kind response.
You have rushed your videos same topic for two different tables ! Calculating between centrality ! You have provided two different tables ? Why is this
Great question! The difference between the two tables comes down to how the centrality is calculated. The first table shows a basic method, while the second one uses a more detailed approach that takes into account situations where there are multiple shortest paths. In those cases, the centrality is split into fractions to make it more accurate. So basically, there are different ways to calculate centrality, and it’s good to know which one fits your needs. Hope that clears it up!
![Introduction to Social Network Analysis [2/5]: The Origins](/img/n.gif)
Hey I love the song in the background!!! Where can I find it? could you provide a link?
Glad you like the background music. That is something personal that is difficult to choose ;) The music is by Scott Holmes Music - New Beginnings and can be found here: freemusicarchive.org/music/Scott_Holmes/inspiring-background-music/new-beginnings/
Thank you very much. I was trying hard to understand this kind of analysis, and your video and explanation helped me a lot!.
We're glad the video was useful to you; we learned a lot while making the videos as well ;)
Great video! 👍
Would not be (a,d,e) the shortest path between pair "a" and "e" (3:30) ?
Yes, they just wrote it wrong in the table.
You are absolutely right! 😄 The shortest route between nodes "a" and "e" should indeed be (a, d, e), as you pointed out in the video at 3:30. It appears that there was an error in the table. I apologize for this mistake, and thank you for noticing it. You are the first among the nearly 12,000 viewers who have watched this video since January 12, 2022, to have spotted this error. 🙌😊
You are welcome. Thanks for nice video!
Why did you put that background music ?
Hi Utku, thanks for your comment. We like videos with background music. However, it is quite difficult to find the right music. We would love to hear your suggestions.
@@symbio6 I think the issue is not about the music you chose. I was not able to hear your voice because of the high volume of the music.
Thanks for your kind response.
aha, thanks for feedback, we'll take it with us in future videos.
Amazing video, thanks!
Glad you liked it!
Thanks
My pleasure.
You have rushed your videos same topic for two different tables ! Calculating between centrality ! You have provided two different tables ? Why is this
Great question! The difference between the two tables comes down to how the centrality is calculated.
The first table shows a basic method, while the second one uses a more detailed approach that takes into account situations where there are multiple shortest paths. In those cases, the centrality is split into fractions to make it more accurate.
So basically, there are different ways to calculate centrality, and it’s good to know which one fits your needs. Hope that clears it up!