how to determine efficiency centrality of a node in Matlab
5 次查看(过去 30 天)
显示 更早的评论
Hi,
Is there any toolbox or code for determing the efficiency centrality of a node in network?
0 个评论
回答(2 个)
Steven Lord
2021-6-12
Build a graph or digraph representation of your network and call centrality on it. Depending on how you define "efficiency" you may want to specify one of the types of centrality. See the description of the type input argument on the documentation page for more information.
0 个评论
Christine Tobler
2021-6-14
编辑:Christine Tobler
2021-6-14
There isn't an efficiency centrality implemented in MATLAB. Based on the paper I quickly read, it seems you would best compute this using
G = graph(1, 2:5);
n = numnodes(G);
D = 1./distances(G);
D(1:n+1:end) = 0; % Set diagonal to zero
P = sum(D, 'all') / n / (n-1);
c = zeros(n, 1);
for i=1:n
Gi = rmnode(G, i);
D = 1./distances(Gi);
D(1:n:end) = 0; % Set diagonal to zero
Pi = sum(D, 'all') / (n-1) / (n-2);
c(i) = (P - Pi) / P;
end
c
Please verify this matches the definition of efficiency centrality you're looking for, since there seem to be modified versions described.
There might be more efficient implementations than this, but I didn't find any paper mentioning a specific algorithm to be used - and this matches the definitions in the paper.
4 个评论
Christine Tobler
2021-6-14
编辑:Christine Tobler
2021-6-14
If the difference is just in the last node, it might have something to do with how the number of nodes is computed for the scaling (the "/ n / (n-1)" part in my code above).
Easiest thing to check that might be to reorder the nodes in the graph using the reordernodes method, and checking if you get the same values (reordered of course).
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!