A series of real networks invariants
By: Mikhail Tuzhilin
Potential Business Impact:
Finds important nodes in networks using math.
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 Laplacian matrix, that have exponential distributions (power-law for the case $j = 0$) for real networks and different distributions for artificial ones.
Similar Papers
New centrality measure: ksi-centrality
Social and Information Networks
Finds important connections in networks.
New exponential law for real networks
Social and Information Networks
Makes computer networks act more like real ones.
Laplacian Network Optimization via Information Functions
Social and Information Networks
Improves computer networks by finding better connections.