Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Temporal nätverksanalys× | Centralitetsanalys× | Analys av sociala nätverk× | |
|---|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys | Nätverksanalys |
| Familj≠ | Process / pipeline | Process / pipeline | Machine learning |
| Ursprungsår≠ | 2012 | 1979 | 1934 (sociometry); 1994 (modern formalization) |
| Upphovsperson≠ | Holme & Saramäki (2012) — seminal framework | Linton C. Freeman | Moreno, J.L.; formalized by Wasserman & Faust |
| Typ≠ | Dynamic graph analysis | Descriptive / exploratory network measure family | Structural/relational analysis framework |
| Ursprungskälla≠ | Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125. DOI ↗ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Alias≠ | dynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks) | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality | SNA, network analysis, sociometric analysis, relational analysis |
| Närliggande≠ | 3 | 5 | 5 |
| Sammanfattning≠ | Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system. | 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. | Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system. |
| ScholarGateDatamängd ↗ |
|
|
|