In this paper we define a family of centrality measures for directed social networks from a game theoretical point of view. We follow the line started in our previous paper (GΓ³mez et al., 2003) and, besides the definition, we obtain a characterization of the measures and an additive decomposition in
A Graph-theoretic perspective on centrality
β Scribed by Stephen P. Borgatti; Martin G. Everett
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 207 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
β¦ Synopsis
The concept of centrality is often invoked in social network analysis, and diverse indices have been proposed to measure it. This paper develops a unified framework for the measurement of centrality. All measures of centrality assess a node's involvement in the walk structure of a network. Measures vary along four key dimensions: type of nodal involvement assessed, type of walk considered, property of walk assessed, and choice of summary measure. If we cross-classify measures by type of nodal involvement (radial versus medial) and property of walk assessed (volume versus length), we obtain a four-fold polychotomization with one cell empty which mirrors Freeman's 1979 categorization. At a more substantive level, measures of centrality summarize a node's involvement in or contribution to the cohesiveness of the network. Radial measures in particular are reductions of pair-wise proximities/cohesion to attributes of nodes or actors. The usefulness and interpretability of radial measures depend on the fit of the cohesion matrix to the onedimensional model. In network terms, a network that is fit by a one-dimensional model has a core-periphery structure in which all nodes revolve more or less closely around a single core. This in turn implies that the network does not contain distinct cohesive subgroups. Thus, centrality is shown to be intimately connected with the cohesive subgroup structure of a network.
π SIMILAR VOLUMES
## Abstract Six Sigma is a phenomenon that is gaining wide acceptance in industry, but lacks a theoretical underpinning and a basis for research other than βbest practiceβ studies. Rigorous academic research of Six Sigma requires the formulation and identification of useful theories related to the
## In this paper we pursue the graph theoretic approach to the switching function minimization problem which is still important in view of today's technological innovations such as programmable Logic arrays. We use switching functions graphs (SFG) for studying the structure of switching functions an