Reliability of measures of centrality and prominence
✍ Scribed by Barbara Zemljič; Valentina Hlebec
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 163 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
✦ Synopsis
This paper evaluates the reliability of measures of centrality and prominence of social networks among high school students. The authors present and discuss results from eight experiments. Four types of social support: (1) instrumental support, (2) informational support, (3) social companionship, and (4) emotional support-were measured three times within each class. Four measurement scales:
(1) binary, (2) categorical, (3) categorical with labels and (4) line production-were applied. Reliability of in-and out-degree, in-and out-closeness, betweenness and flow betweenness was estimated by the Pearson correlation coefficient. Meta analysis of factors affecting the test-retest reliability of measures of centrality and prominence was done by multiple classification analysis. Results show that, -Global measures (considering direct and indirect choices) are more sensitive to measurement errors than local measures (considering only direct choices). -In-measures are more stable than out-measures. -Among types of social support, emotional support gives the least stable measures of centrality and prominence, whereas social companionship gives the most stable results. -The reliability of centrality and prominence measures is higher when the network is denser.
📜 SIMILAR VOLUMES
This note presents a measure of similarity between connected nodes in terms of centrality based on Euclidean distances, and compares it to 'assortative mixing' [Newman, M.E.J., 2002. Assortative mixing in networks. Physical Review Letters 89, 208701], which is based on Pearson correlation coefficien
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 delet
The centrality and efficiency measures of a network G are strongly related to the respective measures on the dual G ⋆ and the bipartite B(G) associated networks. We show some relationships between the Bonacich centralities c(G), c(G ⋆ ) and c(B(G)) and between the efficiencies E(G) and E(G ⋆ ) and w