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.
Bertaccini, D., Chiricosta, L., Filippo, A. (2025). Source-to-sink communicability: a new centrality measure for directed acyclic networks. NUMERICAL ALGORITHMS [10.1007/s11075-025-02224-4].
Source-to-sink communicability: a new centrality measure for directed acyclic networks
Bertaccini, DanieleWriting – Original Draft Preparation
;Chiricosta, LuigiData Curation
;Filippo, Alessandro
Writing – Original Draft Preparation
2025-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
unpaywall-bitstream--1857402442.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
3.21 MB
Formato
Adobe PDF
|
3.21 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
