1 citations · 2 across the 7 of their papers we have counts for
7 papers
Capability centrality: the next step from scale-free property
Mikhail Tuzhilin
In this article we present a new centrality measure called ksi-centrality. We show that ksi-centrality distinguishes real networks from random ones, similar to degree centrality: t…
A series of real networks invariants
Mikhail Tuzhilin
In this article we propose a generalization of two known invariants of real networks: degree and ksi-centrality. More precisely, we found a series of centralities based on Laplacia…
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…
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…
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.
Relations between average clustering coefficient and another centralities in graphs
Mikhail Tuzhilin
Relations between average clustering coefficient and global clustering coefficient, local efficiency, radiality, closeness, betweenness and stress centralities were obtained for si…
Introduction to graph theory and basic algorithms
Mikhail Tuzhilin, Dong Zhang
This book collects the lectures about graph theory and its applications which were given to students of mathematical departments of Moscow State University and Peking University. G…