Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Аналіз спрямованих мультиплексних мереж× | Центральність за спрямованою посередністю× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2013–2014 | 1977 |
| Автор методу≠ | Kivela, M.; De Domenico, M. et al. | Freeman, L. C. |
| Тип≠ | Multi-layer directed graph framework | Centrality measure (directed graph) |
| Основоположне джерело≠ | Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Інші назви | directed multilayer network analysis, directed multiplex graphs, asymmetric multiplex network analysis, DMNA | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness |
| Пов'язані≠ | 6 | 5 |
| Підсумок≠ | Directed multiplex network analysis models systems where the same set of nodes are connected by multiple types of directed (asymmetric) relationships across distinct layers — such as citation flows, information cascades, or authority hierarchies co-existing simultaneously. It extends multiplex network analysis by preserving both layer identity and edge directionality, enabling richer structural and dynamic insights. | Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies. |
| ScholarGateНабір даних ↗ |
|
|