{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/matlab-routines-for-centrality-in-directed","title":"Matlab routines for centrality in directed acyclic graphs","arxiv_id":"2301.07711","date":"2023-01-18","proceeding":null,"authors":["Richard S. J. Tol"],"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.","url_abs":"https://arxiv.org/abs/2301.07711v1","url_pdf":"https://arxiv.org/pdf/2301.07711v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"matlab-routines-for-centrality-in-directed","repo_url":"https://github.com/rtol/nobelnetwork","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}