paper-with-me

Papers

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

2024-07-31 · Saloua Naama, Kavé Salamatian, Francesco Bronzino

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.

📄 PDF Abstract BibTeX arXiv:2407.21609

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Embedding

Similar Papers 제목 키워드 기반

Ironing allocations

2024-02-19 · Filip Tokarski

I propose a new approach to solving standard screening problems when the monotonicity constraint binds. A simple geometric argument shows that when virtual values are quasi-concave, the optimal allocation can be found by…

Robotic Ironing with 3D Perception and Force/Torque Feedback in Household Environments

2017-06-16 · David Estevez, Juan G. Victores, Raul Fernandez-Fernandez, Carlos Balaguer

As robotic systems become more popular in household environments, the complexity of required tasks also increases. In this work we focus on a domestic chore deemed dull by a majority of the population, the task of ironin…

Multivariate Majorization in Principal-Agents Models

2023-08-26 · Nicholas C Bedard, Jacob K Goeree, Ningyi Sun

We introduce a definition of multivariate majorization that is new to the economics literature. Our majorization technique allows us to generalize Mussa and Rosen's (1978) "ironing" to a broad class of multivariate princ…

Decision Making

Unveiling the Sampling Density in Non-Uniform Geometric Graphs

2022-10-15 · Raffaele Paolino, Aleksandar Bojchevski, Stephan Günnemann, Gitta Kutyniok 외

A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified …

Manifold Rewiring for Unlabeled Imaging

2022-09-12 · Valentin Debarnot, Vinith Kishore, Cheng Shi, Ivan Dokmanić

Geometric data analysis relies on graphs that are either given as input or inferred from data. These graphs are often treated as "correct" when solving downstream tasks such as graph signal denoising. But real-world grap…

DenoisingLink Prediction