Compara mètodes

	Krackhardt Hierarchy Measures	Core-Periphery Analysis
Camp	Sociology	Sociology
Família	Process / pipeline	Process / pipeline
Any d'origen	1994	2000
Autor original	David Krackhardt	Stephen Borgatti & Martin Everett
Tipus	Set of four graph-theoretic indices of how hierarchical a network is	Network partition into a dense core and a sparse periphery
Font seminal	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.	Borgatti, S. P., & Everett, M. G. (2000). Models of core/periphery structures. Social Networks, 21(4), 375–395.
Àlies	Krackhardt GTD, graph-theoretic dimensions of hierarchy, Krackhardt connectedness-hierarchy-efficiency-LUB, out-tree hierarchy measures	core/periphery model, Borgatti-Everett core-periphery, core-periphery structure detection, coreness analysis
Relacionats	5	5
Resum	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.	Core/periphery analysis partitions a network into a densely interconnected core of actors and a sparse periphery whose members connect to the core but not to one another. Formalized by Borgatti and Everett, the method fits the observed adjacency matrix to an idealized block pattern — a fully connected core block, an empty periphery block, and core–periphery blocks of intermediate density — to test whether and how strongly a network exhibits this canonical mesoscale structure.