Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Descompunerea k-Core× | Analiza centralității× | |
|---|---|---|
| Domeniu | Analiza rețelelor | Analiza rețelelor |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1983 | 1979 |
| Autorul original≠ | Stephen B. Seidman | Linton C. Freeman |
| Tip≠ | Graph pruning and hierarchical decomposition | Descriptive / exploratory network measure family |
| Sursa seminală≠ | Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269–287. DOI ↗ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ |
| Denumiri alternative | Core Decomposition, Coreness Decomposition, Shell Decomposition, Çekirdek Ayrıştırma | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality |
| Înrudite≠ | 3 | 5 |
| Rezumat≠ | k-Core Decomposition is a graph-theoretic method that partitions the vertices of a network into a nested sequence of subgraphs called k-cores. A k-core is the maximal subgraph in which every vertex has at least k neighbors within that subgraph. Introduced by Stephen B. Seidman in 1983, the method assigns each vertex a coreness number that captures its structural centrality relative to the local connectivity of the graph. | 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. |
| ScholarGateSet de date ↗ |
|
|