This presentation and MATLAB code illustrates the computation of measures
of centrality of individuals within a social network. Measures include
betweenness centrality, eigenvector centrality, and exponential measures
of centrality and betweenness. There is also a version of the Floyd Warshall
algorithm that counts the number of shortest paths.
The presentation, Catching Paul Revere, An Example Of The Analysis Of A Social Network.
The MATLAB code reverecode.zip.
Return to the Brian Borchers Homepage