{"paper":{"title":"An edge centrality measure based on the Kemeny constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"B. Meini, D.A.Bini, D. Altafini, F. Poloni, V. Cutini","submitted_at":"2022-03-12T15:24:47Z","abstract_excerpt":"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 gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06459","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.06459/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}