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.
Loe meetodi täielikku kirjeldust
Selle osa lugemiseks logi sisse tasuta kontoga.
Meetodikaart
Seotud meetodite ümbruskond — vali sõlm, et seda uurida.
Allikad
- 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 ↗
Kuidas sellele lehele viidata
ScholarGate. (2026, June 22). Krackhardt's Graph-Theoretic Dimensions of Hierarchy. ScholarGate. https://scholargate.app/et/sociology/krackhardt-hierarchy
Milline meetod?
Aseta see meetod oma lähimate sugulaste kõrvale ja loe neid kõrvuti — raamatukogu laob raamatud lauale; valik on sinu.
- Core-Periphery AnalysisSociology↔ võrdle
- E-I IndexSociology↔ võrdle
- Generalized BlockmodelingSociology↔ võrdle
- Sotsiaalvõrgustike analüüsVõrgustikuanalüüs↔ võrdle
- Structural Holes AnalysisSociology↔ võrdle
Sarnased meetodid
Märkasid sellel lehel viga? Teata sellest või paku parandust →