arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0712.4216q-bio.QM
收藏

非对角复杂度(Offdiagonal complexity):一种快速计算的网络复杂度度量。蛋白质网络和细胞分裂的应用

Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division

Jens Christian Claussen

摘要:

许多复杂的生物、社会和经济网络显示出与随机图截然不同的拓扑结构。那么,什么是复杂网络呢?如何量化一个图的复杂性?在这里的非对角复杂性(ODC),一个新的,计算成本低,复杂性的措施被定义,基于节点-节点链路交叉分布,其非对角元素的特征图形结构以外的链路分布,集群系数和平均路径长度。将OdC方法应用于{ \sl幽门螺杆菌}蛋白质相互作用网络及其随机重新连接的替代物。此外,ODC用于表征细胞聚集体的空间复杂性。本文研究了秀丽隐杆线虫胚胎的早期发育状态。前形态发生阶段的发育状态由对称二值细胞连接矩阵表示,维数从4增加到385。这些矩阵可以被解释为无向图或网络的邻接矩阵。ODC方法允许定量描述细胞聚集体几何形状的复杂性。

英文摘要:

Many complex biological, social, and economical networks show topologies drastically differing from random graphs. But, what is a complex network, i.e.\ how can one quantify the complexity of a graph? Here the Offdiagonal Complexity (OdC), a new, and computationally cheap, measure of complexity is defined, based on the node-node link cross-distribution, whose nondiagonal elements characterize the graph structure beyond link distribution, cluster coefficient and average path length. The OdC apporach is applied to the {\sl Helicobacter pylori} protein interaction network and randomly rewired surrogates thereof. In addition, OdC is used to characterize the spatial complexity of cell aggregates. We investigate the earliest embryo development states of Caenorhabditis elegans. The development states of the premorphogenetic phase are represented by symmetric binary-valued cell connection matrices with dimension growing from 4 to 385. These matrices can be interpreted as adjacency matrix of an undirected graph, or network. The OdC approach allows to describe quantitatively the complexity of the cell aggregate geometry.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑