Abstract
We analyze subgraph counts in random clustering graphs for general degree distributions. Building on the prior work, we weaken the assumptions required to derive our previous results and exactly determine the asymptotics of subgraph counts in a random clustering graphs under mild conditions. As an application, we analyze the clustering coefficient and cycle counts in random clustering graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aiello, W., Bonato, A., Cooper, C., Janssen, J., Prałat, P.: A spatial web graph model with local influence regions. Internet Math. 5(1–2), 175–196 (2008). https://doi.org/10.1080/15427951.2008.10129305. http://www.internetmathematicsjournal.com/article/1458
Aiello, W., Chung, F., Lu, L.: Random evolution in massive graphs. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets. MC, vol. 4, pp. 97–122. Springer, Boston, MA (2002). https://doi.org/10.1007/978-1-4615-0005-6_4
Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons (2016)
Bloznelis, M., Karjalainen, J., Leskelä, L.: Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs. J. Appl. Probab., 1–19 (2023). https://doi.org/10.1017/jpr.2023.48
Bloznelis, M., Leskelä, L.: Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorithms 63(2), 283–342 (2023). https://doi.org/10.1002/rsa.21140. https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.21140
Bradonjić, M., Hagberg, A., Percus, A.G.: The structure of geographical threshold graphs. Internet Math. 5(1–2), 113–139 (2008)
Bringmann, K., Keusch, R., Lengler, J.: Geometric inhomogeneous random graphs. Theoret. Comput. Sci. 760, 35–54 (2019)
Chung, F., Sieger, N.: A random graph model for clustering graphs. In: Dewar, M., Prałat, P., Szufel, P., Théberge, F., Wrzosek, M. (eds.) WAW 2023. LNCS, vol. 13894, pp. 112–126. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-32296-9_8
Deijfen, M., Kets, W.: Random intersection graphs with tunable degree distribution and clustering (2015)
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)
Young, S.J., Scheinerman, E.R.: Random dot product graph models for social networks. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 138–149. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77004-6_11
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chung, F., Sieger, N. (2024). Subgraph Counts in Random Clustering Graphs. In: Dewar, M., et al. Modelling and Mining Networks. WAW 2024. Lecture Notes in Computer Science, vol 14671. Springer, Cham. https://doi.org/10.1007/978-3-031-59205-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-59205-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-59204-1
Online ISBN: 978-3-031-59205-8
eBook Packages: Computer ScienceComputer Science (R0)