基于树的理论对聚类网络的不合理有效性
The unreasonable effectiveness of tree-based theory for networks with clustering
摘要:
我们证明了一个基于树的各种动态过程的理论产生了非常准确的结果,几个网络具有高层次的聚类。我们发现,只要平均顶点间距离$\ell$足够小,这种理论就能很好地工作,即,只要它接近随机网络中的$\ell$的值,具有可忽略的聚类和相同的度-度相关性。我们证实了这一假设数字使用现实世界的网络从各个领域和几类合成集群网络。我们提出的分析计算,进一步支持我们的主张,基于树的理论可以是准确的集群网络提供的网络是“足够小”的世界。
英文摘要:
We demonstrate that a tree-based theory for various dynamical processes yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance $\ell$ is sufficiently small - i.e., as long as it is close to the value of $\ell$ in a random network with negligible clustering and the same degree-degree correlations. We confirm this hypothesis numerically using real-world networks from various domains and on several classes of synthetic clustered networks. We present analytical calculations that further support our claim that tree-based theories can be accurate for clustered networks provided that the networks are "sufficiently small" worlds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。