1. Triangle-induced and degree-wise sampling over large graphs in social networks.
- Author
-
Gavagsaz, Elaheh and Souri, Alireza
- Abstract
Social networks are crucial channels for information dissemination because they facilitate the effective exchange of ideas and information. The extensive utilization of these networks in daily life results in their explosive growth. Most methods are not practical for large-scale network analysis. Hence, analyzing a small portion instead of the whole network could be preferable, a technique known as graph sampling. According to a literature review, many approaches to graph sampling focus only on representing connectivity from triangle count assessment or node degree evaluation rather than both. This paper introduces an innovative method called TDGS (triangle-induced and degree-wise graph sampling) for producing a sample under the impact of both triangle count and node degree in social networks. The key idea behind TDGS is that it uses a centrality measure based on the degree centrality and local information of nodes about the connectivity of their neighbors to guide the sampling process. Furthermore, TDGS proposes a distributed model that can handle large-scale graphs. We evaluate the performance of our proposed method using real-world social networks. The experimental results show that TDGS provides significantly more precise information about node degrees than the well-known graph sampling methods and can estimate the global clustering coefficient with fewer estimation errors. [ABSTRACT FROM AUTHOR]
- Published
- 2025
- Full Text
- View/download PDF