Krackhardt Hierarchy Measures
Krackhardt's graph-theoretic dimensions provide four indices that together measure how closely a directed network approximates a pure hierarchy — formally, an out-tree. The dimensions are connectedness (is everyone linked?), hierarchy (are ties asymmetric, i.e., non-reciprocated?), efficiency (are there no redundant ties?), and least upper bound (does every pair share a common superior?). Each is scaled from 0 to 1, and a network scoring 1 on all four is a perfect hierarchy.
Kilderegister
Siteringer kopiert ordrett fra metodens kilderegister. Ingen påstandsnivåverifisering er underforstått fra dem.
- Krackhardt, D. (1994). Graph theoretical dimensions of informal organizations. In K. M. Carley & M. J. Prietula (Eds.), Computational Organization Theory (pp. 89–111). Lawrence Erlbaum Associates. · DOI 10.4324/9781315806648-5
- Everett, M. G., & Krackhardt, D. (2012). A second look at Krackhardt's graph theoretical dimensions of informal organizations. Social Networks, 34(2), 159–163. · DOI 10.1016/j.socnet.2011.10.006
Kuraterte påstander
Påstander lagret i bevishovedboken, hver med sin egen vurdering.
Denne visningen finner ikke opp en påstandsvurdering når hovedboken ikke har noen.
Relaterte metoder
Generert fra metodegrafen og vist som maskinforslåtte relasjoner – ingen bevispåstand er underforstått.