Abstract / Description of output
We derive new, exact expressions for network centrality vectors associated with classical Watts-Strogatz style "ring plus shortcut" networks. We also derive easy-to-interpret approximations that are highly accurate in the large network limit. The analysis helps us to understand the role of the Katz parameter and the PageRank parameter, to compare linear system and eigenvalue based centrality measures, and to predict the behavior of centrality measures on more complicated networks.
Keywords / Materials (for Non-textual outputs)