arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.21609cs.CGcs.LG
收藏

熨平图:迈向大规模图的正确几何分析

Ironing the Graphs: Toward a Correct Geometric Analysis of Large-Scale Graphs

Université Savoie Mont Blanc(萨瓦大学);École Normale Supérieure de Lyon(里昂高等师范学校)

Saloua Naama, Kavé Salamatian, Francesco Bronzino

AI总结:

本文针对图嵌入中流形曲率被忽略导致几何推断错误的问题,提出基于离散 Ricci 流的图嵌入方法 dRfge,首次证明其收敛到常曲率,并给出可扩展至 5 万节点以上图的高效算法。

摘要:

图嵌入方法试图将图投影到几何实体(即流形)中。其思想是,投影流形的几何性质有助于推断图的性质。然而,如果嵌入流形的选择不正确,就可能导致错误的几何推断。在本文中,我们论证了经典嵌入技术无法产生正确的几何解释,因为它们忽略了流形在每个点处的曲率。我们主张,为了进行正确的几何解释,图的嵌入应当在规则的常曲率流形上进行。为此,我们提出了一种基于离散 Ricci 流的嵌入方法,即离散 Ricci 流图嵌入(dRfge),该方法调整图中节点之间的距离,使图能够被嵌入到齐性且各向同性的常曲率流形上,即所有方向等价且距离可比,从而得到正确的几何解释。本文的一个主要贡献是,我们首次证明了离散 Ricci 流收敛到常曲率以及边上稳定距离度量的性质。使用离散 Ricci 流的一个缺点是计算复杂度高,这阻碍了其在大规模图分析中的应用。本文的另一个贡献是一种新的算法解决方案,使得计算多达 50k 个节点乃至更大规模图的 Ricci 流变得可行。离散 Ricci 流背后的直观思想使得获得关于大规模图结构的新见解成为可能。我们通过对 BGP 层面国家间互联网连接结构的案例研究来证明这一点。

英文摘要:

Graph embedding approaches attempt to project graphs into geometric entities, i.e, manifolds. The idea is that the geometric properties of the projected manifolds are helpful in the inference of graph properties. However, if the choice of the embedding manifold is incorrectly performed, it can lead to incorrect geometric inference. In this paper, we argue that the classical embedding techniques cannot lead to correct geometric interpretation as they miss the curvature at each point, of manifold. We advocate that for doing correct geometric interpretation the embedding of graph should be done over regular constant curvature manifolds. To this end, we present an embedding approach, the discrete Ricci flow graph embedding (dRfge) based on the discrete Ricci flow that adapts the distance between nodes in a graph so that the graph can be embedded onto a constant curvature manifold that is homogeneous and isotropic, i.e., all directions are equivalent and distances comparable, resulting in correct geometric interpretations. A major contribution of this paper is that for the first time, we prove the convergence of discrete Ricci flow to a constant curvature and stable distance metrics over the edges. A drawback of using the discrete Ricci flow is the high computational complexity that prevented its usage in large-scale graph analysis. Another contribution of this paper is a new algorithmic solution that makes it feasible to calculate the Ricci flow for graphs of up to 50k nodes, and beyond. The intuitions behind the discrete Ricci flow make it possible to obtain new insights into the structure of large-scale graphs. We demonstrate this through a case study on analyzing the internet connectivity structure between countries at the BGP level.

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

↑