Extending assortativity: An application to weighted social networks

Alberto Arcagni, Rosanna Grassi, Silvana Stefani and Anna Torriero

Journal of Business Research, 2021, vol. 129, issue C, 774-783

Abstract: Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describes a tendency for nodes to be connected to others with a similar degree. A generalization of the assortativity index has been proposed in the literature for undirected and unweighted networks, analysing the correlation between vertices that are not necessarily adjacent, but connected through paths, shortest paths and random walks. The aim of this study is to define a new class of higher-order assortativity measures for weighted networks. The effectiveness of these measures is evident in social networks, where both weights and connections are significant. Applications to Facebook and co-authorship networks are provided, analysing the assortativity beyond the nearest neighbours.

Keywords: Assortativity; Weighted networks; Random walks; Social networks (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0148296319305958
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jbrese:v:129:y:2021:i:c:p:774-783

DOI: 10.1016/j.jbusres.2019.10.008

Access Statistics for this article

Journal of Business Research is currently edited by A. G. Woodside

More articles in Journal of Business Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().