An edge centrality measure based on the Kemeny constant
Numerical Analysis
2022-03-28 v2 Numerical Analysis
Abstract
A new measure of the centrality of an edge in an undirected graph is introduced. It is based on the variation of the Kemeny constant of the graph after removing the edge . The new measure is designed in such a way that the Braess paradox is avoided. A numerical method for computing is introduced and a regularization technique is designed in order to deal with cut-edges and disconnected graphs. Numerical experiments performed on synthetic tests and on real road networks show that this measure is particularly effective in revealing bottleneck roads whose removal would greatly reduce the connectivity of the network.
Keywords
Cite
@article{arxiv.2203.06459,
title = {An edge centrality measure based on the Kemeny constant},
author = {D. Altafini and D. A. Bini and V. Cutini and B. Meini and F. Poloni},
journal= {arXiv preprint arXiv:2203.06459},
year = {2022}
}