现实网络中的度量树状结构:一项实证研究
Metric tree-like structures in real-life networks: an empirical study
摘要:
基于坚实的理论基础,我们提出了强有力的证据表明,一些现实生活中的网络,从不同的领域,如互联网测量,生物数据,网络图,社会和协作网络,表现出树状结构从度量的角度来看。我们研究了几个图的参数,即树的扭曲和树的拉伸,树的长度和树的宽度,Gromov的双曲性,集群的直径和集群的半径在一个图的分层分区,捕捉和量化这种现象的度量接近树。通过将所有这些参数放在一起,我们不仅提供了有效的手段来检测这种度量树状结构在大规模的网络,但也显示了如何使用这种结构,例如,有效和compensable编码近似距离和几乎最短路径信息,并快速和准确地估计这些网络的直径和半径。估计图的直径和半径或其任意顶点之间的距离是许多数据和图挖掘算法中的基本原语。
英文摘要:
Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit tree-like structures from a metric point of view. We investigate few graph parameters, namely, the tree-distortion and the tree-stretch, the tree-length and the tree-breadth, the Gromov's hyperbolicity, the cluster-diameter and the cluster-radius in a layering partition of a graph, which capture and quantify this phenomenon of being metrically close to a tree. By bringing all those parameters together, we not only provide efficient means for detecting such metric tree-like structures in large-scale networks but also show how such structures can be used, for example, to efficiently and compactly encode approximate distance and almost shortest path information and to fast and accurately estimate diameters and radii of those networks. Estimating the diameter and the radius of a graph or distances between its arbitrary vertices are fundamental primitives in many data and graph mining algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。