复杂网络中的循环拓扑
Cyclic Topology in Complex Networks
摘要：
本文提出了一种循环系数$R$，它表征了复杂网络的循环特性。如果网络形成完美的树状结构，则$R$变为零。$R$的值越大，表示网络的循环性越强。我们测量了各种真实网络和代表性网络模型的循环系数和局部循环系数的分布，并刻画了它们的循环结构。
英文摘要：
We propose a cyclic coefficient $R$ which represents the cyclic characteristics of complex networks. If the network forms a perfect tree-like structure then $R$ becomes zero. The larger value of $R$ represents that the network is more cyclic. We measure the cyclic coefficients and the distributions of the local cyclic coefficient for both various real networks and the representative network models and characterize the cyclic structures of them.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
