Simplifying social networks via triangle-based cohesive subgraphs  

作　　者：Rusheng Pan Yunhai Wang Jiashun Sun Hongbo Liu Ying Zhao Jiazhi Xia Wei Chen 

机构地区：[1]State Key Lab of CAD&CG,Zhejiang University,Hangzhou China [2]School of Computer Science and Technology,Shandong University,Qingdao,China [3]School of Computer Science and Engineering,Central South University,Changsha,China

出　　处：《Visual Informatics》2023年第4期84-94,共11页可视信息学（英文）

基　　金：supported by National Natural Science Foundation of China(62132017);Fundamental Research Funds for the Central Universities,China(226-2022-00235).

摘　　要：One main challenge for simplifying node-link diagrams of large-scale social networks lies in that simplified graphs generally contain dense subgroups or cohesive subgraphs.Graph triangles quantify the solid and stable relationships that maintain cohesive subgraphs.Understanding the mechanism of triangles within cohesive subgraphs contributes to illuminating patterns of connections within social networks.However,prior works can hardly handle and visualize triangles in cohesive subgraphs.In this paper,we propose a triangle-based graph simplification approach that can filter and visualize cohesive subgraphs by leveraging a triangle-connectivity called k-truss and a force-directed algorithm.We design and implement TriGraph,a web-based visual interface that provides detailed information for exploring and analyzing social networks.Quantitative comparisons with existing methods,two case studies on real-world datasets,and feedback from domain experts demonstrate the effectiveness of TriGraph.

关 键 词：Graph simplification Cohesive subgraphs Graph triangle Graph layout Node-link diagrams 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]