Numerical Algorithms Applied Mathematics

Source-to-sink communicability: a new centrality measure for directed acyclic networks

Daniele Bertaccini, Luigi Chiricosta, Alessandro Filippo
Springer Nature · 2025-09-17 · DOI 10.1007/s11075-025-02224-4

Abstract

Abstract Many processes that can be represented as a series of cascade interactions originating from a source and ending in a sink can be modelled as paths in a directed acyclic graph (DAG). In this work we introduce source-to-sink communicability , a novel centrality measure for DAGs based on the enumeration of source-to-sink walks and an efficient way for computing it. We also include tests on synthetic and protein interaction networks extrapolated from the KEGG (Kyoto Encyclopedia of Genes and Genomes) database as well as comparisons with some of the most popular centrality indices for DAGs.

Read at publisher →