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.
Pročitajte cijelu metodu
Prijavite se besplatnim računom kako biste pročitali ovaj odjeljak.
Karta metoda
Okruženje srodnih metoda — odaberite čvor za istraživanje.
Izvori
- 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 ↗
Kako citirati ovu stranicu
ScholarGate. (2026, June 22). Krackhardt's Graph-Theoretic Dimensions of Hierarchy. ScholarGate. https://scholargate.app/hr/sociology/krackhardt-hierarchy
Koja metoda?
Postavite ovu metodu uz njoj najsrodnije i pročitajte ih jednu uz drugu — knjižnica vam knjige stavlja na stol; izbor je na vama.
- Core-Periphery AnalysisSociology↔ usporedi
- E-I IndexSociology↔ usporedi
- Generalized BlockmodelingSociology↔ usporedi
- Analiza društvenih mrežaAnaliza mreža↔ usporedi
- Structural Holes AnalysisSociology↔ usporedi
Slične metode
Uočili ste pogrešku na ovoj stranici? Prijavite je ili predložite ispravak →