Higher-order assortativity for directed weighted networks and Markov chains

Alberto Arcagni, Roy Cerqueti and Rosanna Grassi

European Journal of Operational Research, 2024, vol. 316, issue 1, 215-227

Abstract: In this paper, we propose a new class of assortativity measures for weighted and directed networks. We extend Newman’s classical degree–degree assortativity by considering node attributes other than degree, and we propose connections among nodes via directed walks of length greater than one, thus obtaining higher-order assortativity. We test the new measure in the paradigmatic case of the world trade network and for other networks from a socioeconomic context, and we also provide some simulation results. Importantly, we show how this global network indicator is strongly related to the autocorrelations of the states of a Markov chain.

Keywords: Networks; Higher-order assortativity; Random walks; Markov chains (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724001620
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:ejores:v:316:y:2024:i:1:p:215-227

DOI: 10.1016/j.ejor.2024.02.031

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

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