Model-free hidden geometry of complex networks
Yi-Jiao Zhang, Kai-Cheng Yang, Filippo Radicchi

TL;DR
This paper explores a model-free method for embedding complex networks into a geometric space, revealing that the resulting hidden geometry reflects network centrality, community structure, and contagion dynamics, with implications for navigation and spreading processes.
Contribution
It introduces a model-free embedding approach that preserves proximity and uncovers meaningful geometric properties of networks without relying on specific geometric assumptions.
Findings
Embedding reflects node centrality and community structure
Proximity preservation enables effective low-dimensional embeddings
Hidden geometry guides greedy navigation and models contagion waves
Abstract
The fundamental idea of embedding a network in a metric space is rooted in the principle of proximity preservation. Nodes are mapped into points of the space with pairwise distance that reflects their proximity in the network. Popular methods employed in network embedding either rely on implicit approximations of the principle of proximity preservation or implement it by enforcing the geometry of the embedding space, thus hindering geometric properties that networks may spontaneously exhibit. Here, we take advantage of a model-free embedding method explicitly devised for preserving pairwise proximity, and characterize the geometry emerging from the mapping of several networks, both real and synthetic. We show that the learned embedding has simple and intuitive interpretations: the distance of a node from the geometric center is representative for its closeness centrality, and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
