论文标题
基于凯门尼常数的边缘中心度度量
An edge centrality measure based on the Kemeny constant
论文作者
论文摘要
引入了一个新的量度$ c（e）$在无向图$ g $中的边缘$ e $的中心性。它基于删除边缘$ e $后图形的kemeny常数的变化。新措施的设计方式使得避免了胸罩悖论。引入了用于计算$ c（e）$的数值方法，并设计了一种正则化技术，以处理切割和断开的图形。在合成测试和真实道路网络上进行的数值实验表明，该措施在揭示瓶颈道路方面特别有效，其拆除将大大降低网络的连通性。
A new measure $c(e)$ of the centrality of an edge $e$ in an undirected graph $G$ is introduced. It is based on the variation of the Kemeny constant of the graph after removing the edge $e$. The new measure is designed in such a way that the Braess paradox is avoided. A numerical method for computing $c(e)$ 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.
