Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| Egohálózat-elemzés× | Centralitás-elemzés× | |
|---|---|---|
| Tudományterület | Hálózatelemzés | Hálózatelemzés |
| Módszercsalád | Process / pipeline | Process / pipeline |
| Keletkezés éve≠ | 1992 (Burt); foundational measurement formalised by Marsden 2002 | 1979 |
| Megalkotó≠ | Ronald S. Burt (structural holes framework); Peter V. Marsden (egocentric measures) | Linton C. Freeman |
| Típus≠ | Descriptive / relational network analysis | Descriptive / exploratory network measure family |
| Alapmű≠ | Burt, R.S. (1992). Structural Holes: The Social Structure of Competition. Harvard University Press. ISBN: 9780674843714 | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ |
| Alternatív nevek≠ | personal network analysis, egocentric network analysis, Ego Ağı Analizi (Personal Network Analysis) | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality |
| Kapcsolódó≠ | 6 | 5 |
| Összefoglaló≠ | Ego network analysis examines the personal network of a focal individual — the ego — by mapping their direct contacts (alters) and the ties those contacts share with one another. Formalised through Ronald Burt's structural holes framework (1992) and Marsden's egocentric measurement approach (2002), the method produces ego-level indicators such as network size, density, constraint, and brokerage role that reveal how each individual's social position shapes their access to information, resources, and influence. | Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors. |
| ScholarGateAdatkészlet ↗ |
|
|