1206.4094 (J. K. Ochab et al.)

Maximal-entropy random walk unifies centrality measures    [PDF]

J. K. Ochab, Z. Burda

We show that a number of known centrality measures for complex networks are closely related and produce equivalent results if defined with the use of the maximal-entropy random walk. This concept allows us to unify centralities based on the principal eigenvector of the adjacency matrix, path enumeration, as well as on the stationary state, stochastic matrix or mean first-passage time matrix of a random walk.

View original: http://arxiv.org/abs/1206.4094