arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1007.4031q-bio.MNcond-mat.dis-nncond-mat.stat-mechphysics.soc-phq-bio.QM
收藏

具有最小平均距离和最大平均聚类的网络

Networks with the Smallest Average Distance and the Largest Average Clustering

Dionysios Barmpoutis, Richard M. Murray

摘要:

我们描述了最小的平均距离和最大的平均聚类给定它们的顺序和大小的图的结构。通常有一个唯一的图具有最大的平均聚类,同时具有最小的平均距离。相反,有许多图具有相同的最小平均距离,忽略它们的平均聚类。这些图表的形式与分析参数。最后,我们测量的灵敏度重新布线的这种架构的聚类系数,我们设计了一种方法,使这些网络更强大的顶点删除。

英文摘要:

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance, ignoring their average clustering. The form of these graphs is shown with analytical arguments. Finally, we measure the sensitivity to rewiring of this architecture with respect to the clustering coefficient, and we devise a method to make these networks more robust with respect to vertex removal.

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

↑