A similarity-based assortativity measure for complex networks
Journal of Complex Networks · 21.02.2024 · 12 (2)
DOI: 10.1093/comnet/cnae010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 13.03.2024. Verfasst von Pablo I Fierens und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 38 Literaturangaben. Gefördert von: Conselho Nacional de Desenvolvimento Científico e Tecnológico.
Abstract (Originalsprache)
There are several metrics that have been proposed to quantify the tendency of nodes to link with similar nodes in complex networks. Among them, the assortativity coefficient put forth by M.E.J. Newman has been successfully used in many cases with either categorical or scalar attributes of network nodes. Unfortunately, the assortativity coefficient cannot deal with vectorial attributes. Furthermore, we show that, in certain cases, it may not be able to capture the similarity of neighbors. In this work, we introduce a new metric that, without being much more complex to calculate, solves those problems. Moreover, we show that the proposed metric includes the categorical assortativity coefficient as a particular case. We also study the behavior of the new metric with a few illustrative real-world examples.
Förderung
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
Zitieren
APA
Fierens, P. I., & Rêgo, L. C. (2024). A similarity-based assortativity measure for complex networks. Journal of Complex Networks, 12(2). https://doi.org/10.1093/comnet/cnae010
Vancouver
Fierens PI, Rêgo LC. A similarity-based assortativity measure for complex networks. Journal of Complex Networks. 2024;12(2). doi:10.1093/comnet/cnae010
BibTeX
@article{Fierens2024,
author = {Fierens, Pablo I and Rêgo, Leandro Chaves},
title = {A similarity-based assortativity measure for complex networks},
journal = {Journal of Complex Networks},
year = {2024},
volume = {12},
number = {2},
doi = {10.1093/comnet/cnae010}
}
EUVIMED