Compressing the data of a complex network is important for visualization. Based on the triangle-subgraph structure in complex networks, complex network filtering compression algorithm based on the triangle-subgraph is proposed. The algorithm starts from the edge, lists nodes of the edge and their common node sets to form a triangle-subgraph set, parses the triangle-subgraph set, and constructs new complex network to complete compression. Before calculating the set of triangle-subgraph, node importance ranking algorithm is proposed to extract high- and low-importance nodes and filter them to reduce computational scale of complex networks. Experimental results show that filtering compression algorithm can not only improve the compression rate but also retain information of the original network at the same time; sorting result analysis and SIR model analysis show that the sorting result of node importance sorting algorithm has accuracy and rationality.

中文翻译：

---

基于三角子图的复杂网络过滤与压缩算法

压缩复杂网络的数据对于可视化很重要。基于复杂网络中的三角形子图结构，提出了基于三角形子图的复杂网络滤波压缩算法。该算法从边缘开始，列出边缘的节点及其公共节点集以形成三角形子图集，解析三角形子图集，并构造新的复杂网络以完成压缩。在计算三角子集之前，提出了节点重要性排序算法，提取高，低重要性节点，并对它们进行过滤，以减少复杂网络的计算规模。实验结果表明，滤波压缩算法不仅可以提高压缩率，而且可以同时保留原始网络的信息。