Abstract
We introduce a random graph model for clustering graphs with a given degree sequence. Unlike previous random graph models, we incorporate clustering effects into the model without any geometric conditions. We show that random clustering graphs can yield graphs with a power-law expected degree sequence, small diameter, and any desired clustering coefficient. Our results follow from a general theorem on subgraph counts which may be of independent interest.
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)
Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53–66 (2001). https://doi.org/em/999188420
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
Albert, R., Barabási, A.L.: Emergence of scaling in random networks. Science 74(5439), 509–512 (1999)
Albert, R., Barabási, A.L., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Phys. A: Stat. Mech. Appl. 281, 69–77 (2000). https://doi.org/10.1016/S0378-4371(00)00018-2
Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, Hoboken (2016)
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. Theor. Comput. Sci. 760, 35–54 (2019)
Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Math. 1(1), 91–113 (2004). https://doi.org/10.1080/15427951.2004.10129081
Chung, F., Lu, L.: The volume of the giant component of a random graph with given expected degrees. SIAM J. Discrete Math. 20(2), 395–411 (2006)
Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Math. 1(3), 257–275 (2004)
Erdős, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17 (1960)
Hyland-Wood, D., Carrington, D., Kaplan, S.: Scale-free nature of java software package, class and method collaboration graphs. In: Proceedings of the 5th International Symposium on Empirical Software Engineering. Citeseer (2006)
Jacob, E., Mörters, P.: A spatial preferential attachment model with local clustering. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 14–25. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03536-9_2
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)
Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)
Steyvers, M., Tenenbaum, J.B.: The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth. Cogn. Sci. 29(1), 41–78 (2005)
Acknowledgments
We thank the anonymous referees for their thorough reviews and invaluable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chung, F., Sieger, N. (2023). A Random Graph Model for Clustering Graphs. In: Dewar, M., Prałat, P., Szufel, P., Théberge, F., Wrzosek, M. (eds) Algorithms and Models for the Web Graph. WAW 2023. Lecture Notes in Computer Science, vol 13894. Springer, Cham. https://doi.org/10.1007/978-3-031-32296-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-32296-9_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-32295-2
Online ISBN: 978-3-031-32296-9
eBook Packages: Computer ScienceComputer Science (R0)