পদ্ধতির তুলনা করুন

	Krackhardt Hierarchy Measures	Structural Holes Analysis
ক্ষেত্র	Sociology	Sociology
পরিবার	Process / pipeline	Process / pipeline
উদ্ভবের বছর	1994	1992
প্রবর্তক	David Krackhardt	Ronald S. Burt
ধরন	Set of four graph-theoretic indices of how hierarchical a network is	Ego-network measure of brokerage opportunity and constraint
মৌলিক উৎস	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.	Burt, R. S. (1992). Structural Holes: The Social Structure of Competition. Harvard University Press. ISBN: 978-0-674-84371-4
অপর নাম	Krackhardt GTD, graph-theoretic dimensions of hierarchy, Krackhardt connectedness-hierarchy-efficiency-LUB, out-tree hierarchy measures	structural holes, Burt constraint, network constraint analysis, effective size analysis
সম্পর্কিত	5	5
সারসংক্ষেপ	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.	Structural holes analysis, developed by Ronald Burt, measures the brokerage opportunities available to an actor by examining the gaps — structural holes — between their otherwise disconnected contacts. An actor whose contacts do not know each other bridges non-redundant sources of information and control and is said to be rich in structural holes; an actor whose contacts are all interconnected is constrained. The core measures — network constraint, effective size, and efficiency — quantify how much advantage an ego's network structure confers.