Link Analysis: Betweenness centrality

In this video, we calculated the betweenness centrality for nodes in a graph. It is the summation of the fraction of the shortest paths between all pairs of nodes having the reference node to all the shortest paths. A node that happens to be more most of the shortest paths of other nodes will have high betweenness centrality. This measure is particularly important to find nodes that are significant in terms of the information flow across the network. #centrality #betweennesscentrality #linkanalysis

[@aadarshsingh2265]

Simple and easy explanation.

[@Dorianazzz]

Why we don"t involve the situation of j>k in the directed graph when we calculate the betweeness centrality? I can understand we ignore these situations in the undirected graph, because the result is double . In this directed graph, if we calculate E→C， the result will be different. I mean E does have an effect on C in the directed graph, which is not reflected in the paths we have already calculated, right?

[@subhamraj7124]

in directed graph why we consider only A to C distance and not C to A?

[@771aryan]

Yes, from C to A should also be considered as they will be different paths. The same applies to DA, EA, DC, EC, ED also. However, in the example, all of these values (DA, EA, DC, EC, ED) will come out to be zero and will not affect the actual result. DA will not be included as there will be no path from D to A.

[@lakshsinghania]

@@771aryanand there is no path from C to A so we have ignored 👍🏻

[@harsh5288]

@@lakshsinghania bro j

[@harshvardhanmishra5819]

Very good explanatory video

[@computationallinguistics3734]

Thank you

[@Dorianazzz]

thanks! it helps a lot!

[@ArunkumarParameswaran]

How to find betweeness of 1000 nodes in undirected graph?? Please do reply for this

[@HanaG-k8x]

in 0/1, how will you get 1?

[@kira15318]

Thank you

[@pr47hmesh]

Thanks :)

[@theonlyvhk28]

Made sense

[@jstransportation2455]

cool