On the robustness of centrality measures under conditions of imperfect data
β Scribed by Stephen P. Borgatti; Kathleen M. Carley; David Krackhardt
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 224 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
β¦ Synopsis
An analysis is conducted on the robustness of measures of centrality in the face of random error in the network data. We use random networks of varying sizes and densities and subject them (separately) to four kinds of random error in varying amounts. The types of error are edge deletion, node deletion, edge addition, and node addition. The results show that the accuracy of centrality measures declines smoothly and predictably with the amount of error. This suggests that, for random networks and random error, we shall be able to construct confidence intervals around centrality scores. In addition, centrality measures were highly similar in their response to error. Dense networks were the most robust in the face of all kinds of error except edge deletion. For edge deletion, sparse networks were more accurately measured.
π SIMILAR VOLUMES
Direct measurements of the xylem sap flow by the stem heat balance technique can be a valuable aid for determining the irrigation demand of field crops. In the present study, soybean (Glyr max (L.) Merr.) sap flow was evaluated under well-watered and water-stressed conditions using Dynamax SGA10 sap
In this paper we give equivalent conditions on the central limit theorem in total variation norm for a sequence of probability measures on ~. This generalizes Cacoullos, Papathanasiou and Utev's central limit theorem in Lt-norm for a sequence of probability density functions on R. We also give equiv