Abstract
Triangles are an essential part of network analysis, representing metrics such as transitivity and clustering coefficient. Using the correspondence between sparse adjacency matrices and graphs, linear algebraic methods have been developed for triangle counting and enumeration, where the main computational kernel is sparse matrix-matrix multiplication. In this paper, we use an intersection representation of graph data implemented as a sparse matrix, and engineer an algorithm to compute the “k-count” distribution of the triangles of the graph. The main computational task of computing sparse matrix-vector products is carefully crafted by employing compressed vectors as accumulators. Our method avoids redundant work by counting and enumerating each triangle exactly once. We present results from extensive computational experiments on large-scale real-world and synthetic graph instances that demonstrate good scalability of our method. In terms of run-time performance, our algorithm has been found to be orders of magnitude faster than the reference implementations of the miniTri data analytics application [18].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdullah, W.M., Hossain, S., Khan, M.A.: Covering large complex networks by cliques—a sparse matrix approach. In: Kilgour, D.M., Kunze, H., Makarov, R., Melnik, R., Wang, X. (eds.) AMMCS 2019. SPMS, vol. 343, pp. 117–127. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-63591-6_11
Abdullah, W.M., Awosoga, D., Hossain, S.: Intersection representation of big data networks and triangle counting. In: 2021 IEEE International Conference on Big Data (Big Data), pp. 5836–5838 (2021). https://doi.org/10.1109/BigData52589.2021.9671349
Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. Wiley Interdiscipl. Rev. Data Min. Knowl. Disc. 8(2), e1226 (2018)
Becchetti, L., Boldi, P., Castillo, C.: Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Discovery Data 4, 1–28 (2010)
Burkhardt, P.: Graphing trillions of triangles. Inf. Vis. 16(3), 157–166 (2017)
Burkhardt, P.: Triangle centrality. arXiv:abs/2105.00110 (2021)
Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Natl. Secur. Agency Tech. Rep. 16(3.1) (2008)
Hasan, M., Hossain, S., Khan, A.I., Mithila, N.H., Suny, A.H.: DSJM: a software toolkit for direct determination of sparse Jacobian matrices. In: Greuel, G.-M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS 2016. LNCS, vol. 9725, pp. 275–283. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42432-3_34
Kepner, J., Gilbert, J.: Graph algorithms in the language of linear algebra. SIAM (2011)
Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http://snap.stanford.edu/data. Accessed 02 Oct 2019
Low, T.M., Rao, V.N., Lee, M., Popovici, D., Franchetti, F., McMillan, S.: First look: linear algebra-based triangle counting without matrix multiplication. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1–6 (2017). https://doi.org/10.1109/HPEC.2017.8091046
Milo, R., Shen-Orr, S., Itzkovitz, S.: Network motifs: simple building blocks of complex network. Science 298, 824–827 (2002)
Palla, G., Dereny, I., Frakas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https://networkrepository.com
Samsi, S., et al.: Static graph challenge: Subgraph isomorphism (2017). http://graphchallenge.mit.edu/data-sets. Accessed 09 July 2021
Samsi, S., et al.: Graphchallenge.org triangle counting performance (2020)
Szpilrajn-Marczewski, E.: A translation of sur deux propriétés des classes d’ensembles by. Fund. Math 33, 303–307 (1945)
Wolf, M.M., Berry, J.W., Stark, D.T.: A task-based linear algebra building blocks approach for scalable graph analytics. In: 2015 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1–6. IEEE (2015)
Acknowledgments
This research was supported in part by NSERC Discovery Grant (Individual), NSERC Undergraduate Student Research Award, and the AITF Graduate Student Scholarship. A part of our computations were performed on Compute Canada HPC system (http://www.computecanada.ca), and we gratefully acknowledge their support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Abdullah, W.M., Awosoga, D., Hossain, S. (2022). Intersection Representation of Big Data Networks and Triangle Enumeration. In: Groen, D., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds) Computational Science – ICCS 2022. ICCS 2022. Lecture Notes in Computer Science, vol 13352. Springer, Cham. https://doi.org/10.1007/978-3-031-08757-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-031-08757-8_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08756-1
Online ISBN: 978-3-031-08757-8
eBook Packages: Computer ScienceComputer Science (R0)