Model-independent embedding of directed networks into Euclidean and hyperbolic spaces

Author:

Kovács Bianka,Palla GergelyORCID

Abstract

AbstractThe arrangement of network nodes in hyperbolic spaces has become a widely studied problem, motivated by numerous results suggesting the existence of hidden metric spaces behind the structure of complex networks. Although several methods have already been developed for the hyperbolic embedding of undirected networks, approaches able to deal with directed networks are still in their infancy. Here, we present a framework based on the dimension reduction of proximity matrices reflecting the network topology, coupled with a general conversion method transforming Euclidean node coordinates into hyperbolic ones even for directed networks. While proposing a measure of proximity based on the shortest path length, we also incorporate an earlier Euclidean embedding method in our pipeline, demonstrating the widespread applicability of our Euclidean-hyperbolic conversion. Besides, we introduce a dimension reduction technique that maps the nodes directly into the hyperbolic space of any number of dimensions with the aim of reproducing a distance matrix measured on the given (un)directed network. According to various commonly used quality scores, our methods are capable of producing high-quality embeddings for several real networks.

Publisher

Springer Science and Business Media LLC

Subject

General Physics and Astronomy

Reference78 articles.

1. Albert, R. & Barabási, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002).

2. Mendes, J. F. F. & Dorogovtsev, S. N. Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford Univ. Press, Oxford, 2003).

3. Newman, M. E. J., Barabási, A.-L. & Watts, D. J. (eds.) The Structure and Dynamics of Networks (Princeton University Press, Princeton and Oxford, 2006).

4. Holme, P. & Saramäki, J. (eds.) Temporal Networks (Springer, Berlin, 2013).

5. Barrat, A., Barthelemy, M. & Vespignani, A. Dynamical Processes on Complex Networks (Cambridge University Press, Cambridge, 2008).

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Greedy routing optimisation in hyperbolic networks;Scientific Reports;2023-12-27

2. Zoo guide to network embedding;Journal of Physics: Complexity;2023-11-29

3. Nearest-neighbor directed random hyperbolic graphs;Physical Review E;2023-11-21

4. Geometric description of clustering in directed networks;Nature Physics;2023-11-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3