{"ID":6537573,"CreatedAt":"2026-07-14T02:54:43.516908796Z","UpdatedAt":"2026-07-15T03:28:55.185153975Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2607.11379","arxiv_id":"2607.11379","title":"Hyperbolic embeddings for graph compression","abstract":"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.","short_abstract":"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...","url_abs":"https://arxiv.org/abs/2607.11379","url_pdf":"https://arxiv.org/pdf/2607.11379v1","authors":"[\"Dorota Celinska-Kopczynska\",\"Eryk Kopczynski\"]","published":"2026-07-13T10:41:48Z","proceeding":"cs.SI","tasks":"[\"cs.SI\",\"physics.soc-ph\"]","methods":"[]","has_code":false}