k-Core based Multi-level Graph Visualization for Scale-free Networks

被引:0
|
作者
An Nguyen [1 ]
Hong, Seok-Hee [1 ]
机构
[1] Univ Sydney, Sch Informat Technol, Sydney, NSW, Australia
来源
2017 IEEE PACIFIC VISUALIZATION SYMPOSIUM (PACIFICVIS) | 2017年
基金
澳大利亚研究理事会;
关键词
I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new multi-level graph drawing algorithm based on the k-core coarsening, a well-known cohesive subgroup analysis method in social network analysis. The k-core of a graph is also known as the degeneracy in graph theory, and can be computed in linear time. Our k-core based multi-level algorithm also includes a new concentric circle placement and a variation of force-directed layout to display the structure of graphs effectively. Experiments with real-world networks suggest that our algorithm performs well for visualization of large and complex scale-free networks, with a power-law degree distribution, a short diameter and a high clustering coefficient. Comparison with other multi-level algorithms shows that our method is fast and effective, in particular performs better than Walshaw [26] and FM3 [15].
引用
收藏
页码:21 / 25
页数:5
相关论文
共 50 条
  • [31] De-anonymizing Scale-free Social Networks by Percolation Graph Matching
    Chiasserini, Carla Fabiana
    Garetto, Michele
    Leonardi, Emilio
    2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), 2015,
  • [32] Fractals of internet router-level topology based on k-core decomposition
    Zhang, Jun
    Zhao, Hai
    Kang, Min
    Wang, Wei
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2010, 31 (04): : 511 - 514
  • [33] Merit: multi-level graph embedding refinement framework for large-scale graph
    Weishuai Che
    Zhaowei Liu
    Yingjie Wang
    Jinglei Liu
    Complex & Intelligent Systems, 2024, 10 : 1303 - 1318
  • [34] Merit: multi-level graph embedding refinement framework for large-scale graph
    Che, Weishuai
    Liu, Zhaowei
    Wang, Yingjie
    Liu, Jinglei
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 10 (1) : 1303 - 1318
  • [35] An improved Nystrom spectral graph clustering using k-core decomposition as a sampling strategy for large networks
    Tu, Jingzhi
    Mei, Gang
    Piccialli, Francesco
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (06) : 3673 - 3684
  • [36] Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks
    杨洪勇
    路兰
    曹科才
    张嗣瀛
    Communications in Theoretical Physics, 2010, 53 (04) : 787 - 792
  • [37] Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks
    Yang Hong-Yong
    Lu Lan
    Cao Ke-Cai
    Zhang Si-Ying
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2010, 53 (04) : 787 - 792
  • [38] The Multi-Role Hidden Tree Model for Scale-free Networks
    Bu, Zhiqiong
    2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL MODELING IN PHYSICAL SCIENCES 2013 (IC-MSQUARE 2013), 2014, 490
  • [39] Cascade Graph Convolution Network Based on Multi-level Graph Structures in Heterogeneous Graph
    Song, Ling-Yun
    Liu, Zhi-Zhen
    Zhang, Yang
    Li, Zhan-Huai
    Shang, Xue-Qun
    Ruan Jian Xue Bao/Journal of Software, 2024, 35 (11): : 5179 - 5195
  • [40] Research on Delay Characteristics of Information in Scale-free Networks Based on Multi-Agent Simulation
    Gong, Xiaoguang
    Xu, Jie
    FIRST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT, 2013, 17 : 989 - 1002