Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Зважений аналіз мультиплексних мереж× | Зважена центральність за власним вектором× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2014 | 1987 (binary); 2010 (weighted generalization) |
| Автор методу≠ | Battiston, F.; Kivela, M. et al. | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) |
| Тип≠ | Network analysis framework | Spectral centrality measure |
| Основоположне джерело≠ | Battiston, F., Nicosia, V., & Latora, V. (2014). Structural measures for multiplex networks. Physical Review E, 89(3), 032804. DOI ↗ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ |
| Інші назви | WMNA, weighted multilayer network analysis, weighted multi-relational network analysis, multiplex weighted graph analysis | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige |
| Пов'язані≠ | 5 | 6 |
| Підсумок≠ | Weighted multiplex network analysis studies systems in which the same set of actors are connected through multiple types of relationships simultaneously, and each relationship carries a quantitative strength or frequency. By capturing both the variety and the intensity of ties across layers, it reveals patterns invisible to single-layer or unweighted network approaches. | Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. |
| ScholarGateНабір даних ↗ |
|
|