Paper detail

On the stability of network indices defined by means of matrix functions

Identifying important components in a network is one of the major goals of network analysis. Popular and effective measures of importance of a node or a set of nodes are defined in terms of suitable entries of functions of matrices $f(A)$. These kinds of measures are particularly relevant as they are able to capture the global structure of connections involving a node. However, computing the entries of $f(A)$ requires a significant computational effort. In this work we address the problem of estimating the changes in the entries of $f(A)$ with respect to changes in the edge structure. Intuition suggests that, if the topology of connections in the new graph $\tilde G$ is not significantly distorted, relevant components in $G$ maintain their leading role in $\tilde G$. We propose several bounds giving mathematical reasoning to such intuition and showing, in particular, that the magnitude of the variation of the entry $f(A)_{k\ell}$ decays exponentially with the shortest-path distance in $G$ that separates either $k$ or $\ell$ from the set of nodes touched by the edges that are perturbed. Moreover, we propose a simple method that exploits the computation of $f(A)$ to simultaneously compute the all-pairs shortest-path distances of $G$, with essentially no additional cost. As the nodes whose edge connection tends to change more often or tends to be more often affected by noise have marginal role in the graph and are distant from the most central nodes, the proposed bounds are particularly relevant.