Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Багатошарова центральність за ступенем× | Центральність за ступенем× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2013–2014 | 1978 |
| Автор методу≠ | Kivelä, M.; De Domenico, M. et al. | Freeman, L. C. |
| Тип≠ | Centrality measure for multilayer networks | Node-level centrality measure |
| Основоположне джерело≠ | Kivelä, 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. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Інші назви | multilayer degree, multiplex degree centrality, overlapping-layer degree centrality, MDC | node degree, degree score, DC, connectivity centrality |
| Пов'язані | 6 | 6 |
| Підсумок≠ | Multilayer degree centrality extends the classic degree centrality measure to networks composed of multiple layers — such as networks representing different types of social ties, communication channels, or relationship contexts simultaneously. It quantifies how many connections a node has across one or all layers, revealing nodes that are influential not just in a single context but across the entire multi-relational structure. | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. |
| ScholarGateНабір даних ↗ |
|
|