Matlab routines for centrality in directed acyclic graphs
Richard S. J. Tol
TL;DR
This paper introduces new MATLAB functions for network centrality in directed acyclic graphs, utilizing generalized mean distances, customizable node considerations, and novel closeness measures including cross-closeness.
Contribution
The paper presents novel MATLAB routines that extend centrality measures with generalized mean distances and new closeness concepts for directed acyclic graphs.
Findings
New MATLAB functions for centrality analysis
Generalized mean distance for unconnected graphs
Introduction of horizontal cross-closeness
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Optical Network Technologies · Complex Network Analysis Techniques