3 papers
math.NA2026
Component-wise accurate computation of the square root of an M-matrix
Dario A. Bini, Bruno Iannazzo, Beatrice Meini +1
Component-wise accurate algorithms for computing the principal square root of an M-matrix are designed in terms of triplet representations. A triplet representation of an M-matrix…
math.NA2025
The Derivative of Kemeny's Constant as a Centrality Measure in Undirected Graphs
Dario A. Bini, Beatrice Meini, Federico Poloni
Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional deriva…
math.NA2025
Cut-edge centralities in an undirected graph
Dario Bini, Steve Kirkland, Guy Latouche +1
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 expressi…