1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.SI2025
New exponential law for real networks
Mikhail Tuzhilin
In this article we have shown that the distributions of ksi satisfy an exponential law for real networks while the distributions of ksi for random networks are bell-shaped and clos…
cs.SI2025
New centrality measure: ksi-centrality
Mikhail Tuzhilin
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 tha…
cs.SI2024★ 1 cited
Relations between average shortest path length and another centralities in graphs
Mikhail Tuzhilin
Relations between average shortest path length and average clustering coefficient, radiality, closeness and stress centralities were obtained for simple graphs.