Abstract
Clustering coefficient is an important measure in complex graph analysis. Tracking clustering coefficient on dynamic graphs, such as Web, social networks and mobile networks, can help in spam detection, community mining and many other applications. However, it is expensive to compute clustering coefficient for real-world graphs, especially for large and evolving graphs. Aiming to track the clustering coefficient on dynamic graph efficiently, we propose an incremental algorithm. It estimates the average and global clustering coefficient via random walk and stores the random walk path. As the graph evolves, the proposed algorithm reconstructs the stored random walk path and updates the estimates incrementally. Theoretical analysis indicates that the proposed algorithm is practical and efficient. Extensive experiments on real-world graphs also demonstrate that the proposed algorithm performs as well as a state-of-art random walk based algorithm in accuracy and reduces the running time of tracking the clustering coefficient on evolving graphs significantly.
This is a preview of subscription content, log in via an institution to check access.
References
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Shen, G., Gao, B., Liu, T.Y., Feng, G., Song, S., Li, H.: Detecting link spam using temporal information. In: 6th IEEE International Conference on Data Mining, pp. 1049–1053. IEEE Press, New York (2006)
Benevenuto, F., Rodrigues, T., Almeida, V., Almeida, J., Gonçalves, M.: Detecting spammers and content promoters in online video social networks. In: 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 620–627. ACM, New York (2009)
Akoglu, L., Dalvi, B.: Structure, tie persistence and event detection in large phone and SMS networks. In: 8th Workshop on Mining and Learning with Graphs, pp. 10–17. ACM, New York (2010)
Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Discov. Data (TKDD) 4(3), 13 (2010)
Park, H.M., Chung, C.W.: An efficient mapreduce algorithm for counting triangles in a very large graph. In 22nd ACM International Conference on Information & Knowledge Management, pp. 539–548. ACM, New York (2013)
Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: DOULION: counting triangles in massive graphs with a coin. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 837–846. ACM, New York (2009)
Seshadhri, C., Pinar, A., Kolda, T.G.: Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. ASA Data Sci. J. 7(4), 294–307 (2014)
Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: 22nd International Conference on World Wide Web, pp. 539–550. ACM, New York (2013)
Costa, L.D.F., Rodrigues, F.A., Travieso, G., Villas Boas, P.R.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167–242 (2007)
Katzir, L., Hardiman, S.J.: Estimating clustering coefficients and size of social networks via random walk. ACM Trans. Web (TWEB) 9(4), 19 (2015)
Stanford large network dataset collection. http://snap.stanford.edu/data/index.html
Schank, T.: Algorithmic aspects of triangle-based network analysis. Ph.D. thesis, Universität Karlsruhe (TH) (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Liao, Q., Sun, L., Yuan, Y., Yang, Y. (2017). Tracking Clustering Coefficient on Dynamic Graph via Incremental Random Walk. In: Bouguettaya, A., et al. Web Information Systems Engineering – WISE 2017. WISE 2017. Lecture Notes in Computer Science(), vol 10569. Springer, Cham. https://doi.org/10.1007/978-3-319-68783-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-68783-4_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68782-7
Online ISBN: 978-3-319-68783-4
eBook Packages: Computer ScienceComputer Science (R0)