Matlab routines for centrality in directed acyclic graphs

Richard Tol

Economics Software Archive from Department of Economics, University of Sussex Business School

Abstract: New Matlab functions for network centrality are introduced. Instead of the mean distance, the generalized mean distance is used. If closer relationships are prioritized, this closeness measure is also defined for unconnected graphs. Instead of distance to all nodes, distance to selected nodes is considered. Besides the vertical in- and out-closeness measures, horizontal cross-closeness is proposed.

Language: Matlab
JEL-codes: C22 C88 (search for similar items in EconPapers)
Date: 2023-01-18
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/abs/2301.07711

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:sus:susesa:0223

Access Statistics for this software item

More software in Economics Software Archive from Department of Economics, University of Sussex Business School Contact information at EDIRC.
Bibliographic data for series maintained by University of Sussex Business School Communications Team ().