This topic elaborates on the measurement of prominence and influence in computational social networks through formalized centrality and prestige metrics. Degree, Closeness, and Betweenness Centrality are introduced as distinct yet complementary perspectives on structural importance, each quantifying visibility, accessibility, and brokerage. The computational efficiency of their implementation—particularly via Brandes’ algorithm for Betweenness—is emphasized to demonstrate the algorithmic trade-offs inherent in network analysis. Eigenvector-based models such as PageRank and HITS are then examined as methods for capturing hierarchical influence in directed networks, highlighting how recursive computation embeds notions of authority and reputation within digital systems. 

The discussion extends to the ethical implications of quantifying influence, emphasizing that computational power also confers the ability to profile, classify, and potentially harm individuals. Analytical transparency, methodological disclosure, and proportionality in interpretation are presented as core principles for responsible influence analysis. The topic concludes that the computational study of prominence is inseparable from its ethical dimension, as measurement itself shapes perception and power.

Learning Outcomes

Guide Questions

Topic Outline

Reading List