Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.19603 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916641917370368 |
|---|---|
| author | Bini, Dario Kirkland, Steve Latouche, Guy Meini, Beatrice |
| author_facet | Bini, Dario Kirkland, Steve Latouche, Guy Meini, Beatrice |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19603 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cut-edge centralities in an undirected graph Bini, Dario Kirkland, Steve Latouche, Guy Meini, Beatrice Numerical Analysis 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. |
| title | Cut-edge centralities in an undirected graph |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2411.19603 |