Hyperbolic embeddings for graph compression

Dorota Celinska-Kopczynska; Eryk Kopczynski

Hyperbolic embeddings for graph compression

社会与信息网络 2026-07-13 v1 物理与社会

作者: Dorota Celinska-Kopczynska , Eryk Kopczynski

摘要

Network theoreticians hypothesize that the structure of real-world networks has a geometric origin. Especially, hyperbolic geometry was proven insightful in representing and modeling of scale-free networks. Embedders are algorithms used to find a geometric representation of a network. In this study, we introduce a fast lossless graph compression algorithm based on modern hyperbolic embedders. Experimental validation on real-world and generated networks shows that our algorithm beats state-of-the-art by up to 42% on real-world graphs.

引用

@article{arxiv.2607.11379,
  title  = {Hyperbolic embeddings for graph compression},
  author = {Dorota Celinska-Kopczynska and Eryk Kopczynski},
  journal= {arXiv preprint arXiv:2607.11379},
  year   = {2026}
}