Matlab routines for centrality in directed acyclic graphs
Other Statistics
2023-01-20 v1
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.
Cite
@article{arxiv.2301.07711,
title = {Matlab routines for centrality in directed acyclic graphs},
author = {Richard S. J. Tol},
journal= {arXiv preprint arXiv:2301.07711},
year = {2023}
}