Relations between average shortest path length and another centralities in graphs

2024/12/03 by Tuzhilin, Mikhail
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Social and Information Networks (cs.SI)

paper · doi:10.48550/arxiv.2412.03601

Abstract

Relations between average shortest path length and average clustering coefficient, radiality, closeness and stress centralities were obtained for simple graphs.

Related

• Relations between average clustering coefficient and another centralities in graphs
• Relationships Between Characteristic Path Length, Efficiency, Clustering Coefficients, and Graph Density
• An Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density
• Centrality of shortest paths: Algorithms and complexity results
• Network analysis with the aid of the path length matrix