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.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Metodekort
Nabolaget af beslægtede metoder — vælg en knude for at udforske.
Kilder
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 22). Krackhardt's Graph-Theoretic Dimensions of Hierarchy. ScholarGate. https://scholargate.app/da/sociology/krackhardt-hierarchy
Hvilken metode?
Stil denne metode ved siden af dens nærmeste slægtninge, og læs dem side om side — biblioteket lægger bøgerne på bordet; valget er dit.
- Core-Periphery AnalysisSociology↔ sammenlign
- E-I IndexSociology↔ sammenlign
- Generalized BlockmodelingSociology↔ sammenlign
- Social netværksanalyseNetværksanalyse↔ sammenlign
- Structural Holes AnalysisSociology↔ sammenlign
Lignende metoder
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →