复杂网络中作为更窄度分布的更大环
Larger holes as narrower degree distributions in complex networks
AI总结：
本文研究了复杂网络中度分布与环长度的关系，发现更窄的度分布普遍对应更长的最短环，并建议构建O(log N)的长环以增强连通性鲁棒性。
摘要：
尽管由于复杂性，对环的分析并不多，但已经发现启发式地增强环能降低度分布的方差，从而提升连通性的鲁棒性。虽然许多真实的无标度网络已知包含如三角形这样的短环，但在更广泛的网络类别中，长环的分布仍有待研究。在研究度分布连续变化的各种网络（包括三种典型的现实无标度网络、经典Erdös-Rényi随机图和正则网络）中最短环的长度时，我们发现了更窄的度分布与更长环之间的关系。特别地，我们展示了更窄的度分布包含更长的最短环，作为广泛随机网络中的一项普遍性质。我们建议通过构建O(log N)的长环来增强连通性的鲁棒性。
英文摘要：
Although the analysis of loops is not so much because of the complications, it has already been found that heuristically enhancing loops decreases the variance of degree distributions for improving the robustness of connectivity. While many real scale-free networks are known to contain shorter loops such as triangles, it remains to investigate the distributions of longer loops in more wide class of networks. We find a relation between narrower degree distributions and longer loops in investigating the lengths of the shortest loops in various networks with continuously changing degree distributions, including three typical types of realistic scale-free networks, classical Erdös-Rényi random graphs, and regular networks. In particular, we show that narrower degree distributions contain longer shortest loops, as a universal property in a wide class of random networks. We suggest that the robustness of connectivity is enhanced by constructing long loops of O(log N).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
