Scholarlink

<p>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 <i>source-to-sink communicability</i>, 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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年9月17日

查看全文
  • Daniele Bertaccini,
  • Luigi Chiricosta,
  • Alessandro Filippo

摘要

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.