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. We also derive accurate upper and lower bounds for the domiannt, Perron-Frobenius, eigenvalue of a “ring plus shortcut” network. The results areillustrated with computational experiments, and directions for future work are discussed.
| Date of Award | 20 Oct 2022 |
|---|
| Original language | English |
|---|
| Awarding Institution | - University Of Strathclyde
|
|---|
| Sponsors | University of Strathclyde |
|---|
| Supervisor | Kerem Akartunali (Supervisor) |
|---|