Papers › New centrality measure: ksi-centrality
New centrality measure: ksi-centrality
Mikhail Tuzhilin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce new centrality measures, called ksi-centrality and normalized ksi-centrality measure the importance of a node up to the importance of its neighbors. First, we show that normalized ksi-centrality can be rewritten in terms of the Laplacian matrix such that its expression is similar to the local clustering coefficient. After that we introduce average normalized ksi-coefficient and show that for a random Erdos-Renyi graph it is almost the same as average clustering coefficient. It also shows behavior similar to the clustering coefficient for the Windmill and Wheel graphs. Finally, we show that the distributions of ksi centrality and normalized ksi centrality distinguish networks based on real data from artificial networks, including the Watts-Strogatz, Barabasi-Albert and Boccaletti-Hwang-Latora small-world networks. Furthermore, we show the relationship between normalized ksi centrality and the average normalized ksi coefficient and the algebraic connectivity of the graph and the Chegeer number.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections