Text
An Edge Centrality Measure Based on the Kemeny Constant
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 to satisfy certain monotonicity and positivity properties, and hence using it one can avoid the Braess paradox, i.e., the phenomenon in which removing an edge can increase the connectivity of a network rather than reduce it. 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 both on artificial examples 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.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art146543 | null | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain