Hai Jin

Distributed Algorithms for Random Walk Interpolated Betweenness Centralities

Betweenness centrality quantifies a node's influence on information spread. While classical shortest-path metrics ignore path redundancy, random walk betweenness centrality considers all possible routes but over-emphasizes circuitous ones. To bridge these extremes, interpolated measures offer a tunable continuum betwee...