title: Visual reasoning about social networks using centrality sensitivity.
abstract: In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance of a node in a network, its sensitivity represents the importance of the relationship between this and all other nodes in the network. We have derived an analytical solution that extracts the sensitivity as the derivative of centrality with respect to degree for two centrality metrics based on feedback and random walks. We show that these sensitivities are good indicators of the distribution of centrality in the network, and how changes are expected to be propagated if we introduce changes to the network. These metrics also help us simplify a complex network in a way that retains the main structural properties and that results in trustworthy, readable diagrams. Sensitivity is also a key concept for uncertainty analysis of social networks, and we show how our approach may help analysts gain insight on the robustness of key network metrics. Through a number of examples, we illustrate the need for measuring sensitivity, and the impact it has on the visualization of and interaction with social and other scale-free networks.
authors.affiliation: Lawerence Livermore National Laboratory, Livermore, CA, USA. correac@llnl.gov
authors.forename: Carlos D
authors.initials: CD
authors.lastname: Correa
authors.forename: Tarik
authors.initials: T
authors.lastname: Crnovrsanin
authors.forename: Kwan-Liu
authors.initials: KL
authors.lastname: Ma
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D003198:Computer Simulation; D016208:Databases, Factual; D008390:Markov Chains; D008962:Models, Theoretical; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012944:Social Support