论文标题
通过最小同源碱基的同源支架
Homological Scaffold via Minimal Homology Bases
论文作者
论文摘要
同源脚手架利用持续的同源性来构建加权网络的拓扑合理摘要。但是，其对代表周期选择的至关重要的依赖性阻碍了将全局特征追溯到单个网络组件的能力，除非有人提供了做出这种选择的原则方法。在本文中，我们在最小同源碱基的计算中应用了最新进展，以引入脚手架的准典型版本，称为最小值，并采用它来分析真实和硅的数据。同时，我们从统计上验证，标准支架是足够复杂网络的最小值的良好代理。
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global features onto individual network components, unless one provides a principled way to make such a choice. In this paper, we apply recent advances in the computation of minimal homology bases to introduce a quasi-canonical version of the scaffold, called minimal, and employ it to analyze data both real and in silico. At the same time, we verify that, statistically, the standard scaffold is a good proxy of the minimal one for sufficiently complex networks.
