A hyperbolic embedding for scale-free networks

被引:0
|
作者
Shen, Xin [1 ]
Huang, Weijian [1 ]
Gong, Jing [1 ]
Sun, Zhixin [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Sci, Nanjing, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Post Big Data Technol & Applicat Engn Res Ctr Jia, Post Ind Technol Res & Dev Ctr, State Posts Bur Internet Things Technol, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
hyperbolic space; graph convolution; variational graph auto-encoder; scale-free networks;
D O I
10.1109/DASC-PICom-CBDCom-CyberSciTech52372.2021.00114
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph neural network, with its powerful learning ability, has become a cutting-edge method of processing ultra-large-scale network data. In order to polished up the representation accuracy of embedding, the key is to find the intrinsic geometric metric of the complex network. Since the real data is mostly scale-free network, the embedding accuracy of traditional models is still limited by the dimensionality of the euclidean space and computational complexity. Therefore, the hyperbolic embedding, whose metric properties conform to the power-law distribution and tree-like hierarchical structure of the complex network, will effectively approximates the latent lowdimensional manifold of the data distribution. This paper proposes an auto-encoder in hyperbolic space (HVGAE), taking full use of hyperbolic graph convolutional (HGCN) and the idea of variational autoencoder. Under the optimal combination of the encoder module, competitive results have been achieved in different real scenarios.
引用
收藏
页码:679 / 685
页数:7
相关论文
共 50 条
  • [1] Geographical embedding of scale-free networks
    ben-Avraham, D
    Rozenfeld, AF
    Cohen, R
    Havlin, S
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 330 (1-2) : 107 - 116
  • [2] Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
    Blaesius, Thomas
    Friedrich, Tobias
    Krohmer, Anton
    Laue, Soeren
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (02) : 920 - 933
  • [3] Exactly scale-free scale-free networks
    Zhang, Linjun
    Small, Michael
    Judd, Kevin
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 433 : 182 - 197
  • [4] Subnets of scale-free networks are not scale-free: Sampling properties of networks
    Stumpf, MPH
    Wiuf, C
    May, RM
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (12) : 4221 - 4224
  • [5] Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
    Blasius, Thomas
    Freiberger, Cedric
    Friedrich, Tobias
    Katzmann, Maximilian
    Montenegro-Retana, Felix
    Thieffry, Marianne
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (02)
  • [6] Scale-free networks
    Barabási, AL
    Bonabeau, E
    SCIENTIFIC AMERICAN, 2003, 288 (05) : 60 - 69
  • [7] Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
    Papadopoulos, Fragkiskos
    Krioukov, Dmitri
    Boguna, Marian
    Vahdat, Amin
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [8] Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
    Blaesius, Thomas
    Friedrich, Tobias
    Katzmann, Maximilian
    ALGORITHMICA, 2023, 85 (12) : 3487 - 3520
  • [9] On Searching Multiple Disjoint Shortest Paths in Scale-Free Networks With Hyperbolic Geometry
    Wang, Qiang
    Jiang, Hao
    Jiang, Ying
    Yi, Shuwen
    Li, Lixia
    Xing, Cong-Cong
    Huang, Jun
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (04): : 2772 - 2785
  • [10] Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
    Thomas Bläsius
    Tobias Friedrich
    Maximilian Katzmann
    Algorithmica, 2023, 85 : 3487 - 3520