One of the properties interest in analysis networks is global communicability, i.e., how easy or difficult it is, generally, to reach nodes from other by following edges. Different communicability measures provide quantitative assessments this property, emphasizing different aspects problem. This paper investigates sensitivity local changes. In particular, for directed, weighted networks, we st...

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...