Cut-edge centralities in an undirected graph
Numerical Analysis
2025-03-05 v3 Numerical Analysis
Abstract
A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit expression is provided for some classes of graphs, including one-path graphs and trees formed by three or more branches. These results theoretically confirm the good physical behaviour of this centrality measure, experimentally observed in [Altafini et al.~SIMAX 2023]. Numerical tests are reported to check the stability and to confirm the good physical behaviour.
Cite
@article{arxiv.2411.19603,
title = {Cut-edge centralities in an undirected graph},
author = {Dario Bini and Steve Kirkland and Guy Latouche and Beatrice Meini},
journal= {arXiv preprint arXiv:2411.19603},
year = {2025}
}