Hierarchical Network Compression Algorithm Based on Splitting and Merging Unimportant Nodes

As an important network visualization technique,network compression can show the global network structure of large scale networks.To solve the unfair problem in partitioning and show the hierarchical structures quickly with different scales,this paper proposes a hierarchical network compression algorithm based on splitting and merging unimportant nodes.The algorithm firstly proposes a method to measure the importance of different node blocks based on the definition of node blocks and connections between them.Then,motivated by the process of re-source allocation,it proposes a hierarchical aggregation mechanism based on node splitting.Finally,it can quickly compress the network by splitting and merging unimportant nodes in each hierarchical structure compression.Empirical study on several real networks shows that the proposed algorithm can solve the unfair problem in partitioning and achieve a good performance on visualization with multiple hierarchical compression structures,compared with other methods.