Abstract
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs similar to the well-known LFR model but it is faster and can be investigated analytically. In this paper, we show that the ABCD model exhibits some interesting self-similar behaviour, namely, the degree distribution of ground-truth communities is asymptotically the same as the degree distribution of the whole graph (appropriately normalized based on their sizes). As a result, we can not only estimate the number of edges induced by each community but also the number of self-loops and multi-edges generated during the process. Understanding these quantities is important as (a) rewiring self-loops and multi-edges to keep the graph simple is an expensive part of the algorithm, and (b) every rewiring causes the underlying configuration models to deviate slightly from uniform simple graphs on their corresponding degree sequences.
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
Similar content being viewed by others
References
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Bender, E.A., Canfield, E.R.: The asymptotic number of labeled graphs with given degree sequences. J. Comb. Theory Ser. A 24(3), 296–307 (1978)
Blagus, N., Šubelj, L., Bajec, M.: Self-similar scaling of density in complex real-world networks. Phys. A 391(8), 2794–2802 (2012)
Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1(4), 311–316 (1980)
Broido, A.D., Clauset, A.: Scale-free networks are rare. Nat. Commun. 10(1), 1017 (2019)
Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Nat. Acad. Sci. 104(1), 36–41 (2007)
Gallos, L.K., Song, C., Makse, H.A.: A review of fractality and self-similarity in complex networks. Phys. A 386(2), 686–691 (2007)
Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68(6), 065103 (2003)
Holme, P.: Rare and everywhere: perspectives on scale-free networks. Nat. Commun. 10(1), 1016 (2019)
Janson, S.: Random graphs with given vertex degrees and switchings. Random Struct. Algorithms 57(1), 3–31 (2020)
Kamiński, B., Pankratz, B., Prałat, P., Théberge, F.: Modularity of the ABCD random graph model with community structure. J. Complex Netw. 10(6), cnac050 (2022)
Kamiński, B., Prałat, P., Théberge, F.: Artificial benchmark for community detection (ABCD)-fast random graph model with community structure. Netw. Sci., 1–26 (2021)
Kamiński, B., Prałat, P., Théberge, F.: Artificial benchmark for community detection with outliers (ABCD+o). Appl. Netw. Sci. 8(1), 25 (2023)
Kamiński, B., Prałat, P., Théberge, F.: Hypergraph artificial benchmark for community detection (h–ABCD). J. Complex Netw. 11(4), cnad028 (2023)
Kamiński, B., Olczak, T., Pankratz, B., Prałat, P., Théberge, F.: Properties and performance of the ABCDe random graph model with community structure. Big Data Res. 30, 100348 (2022)
Kim, J., Goh, K.I., Salvi, G., Oh, E., Kahng, B., Kim, D.: Fractality in complex networks: critical and supercritical skeletons. Phys. Rev. E 75(1), 016110 (2007)
Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)
Mandelbrot, B.B.: The Fractal Geometry of Nature, vol. 1. WH Freeman New York (1982)
Serrano, M.Á., Krioukov, D., Boguná, M.: Self-similarity of complex networks and hidden metric spaces. Phys. Rev. Lett. 100(7), 078701 (2008)
Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392–395 (2005)
Wormald, N.C.: Generating random regular graphs. J. Algorithms 5(2), 247–280 (1984)
Wormald, N.C., et al.: Models of random regular graphs. In: London Mathematical Society Lecture Note Series, pp. 239–298 (1999)
Zhou, B., Meng, X., Stanley, H.E.: Power-law distribution of degree-degree distance: a better representation of the scale-free property of complex networks. Proc. Nat. Acad. Sci. 117(26), 14812–14818 (2020)
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
Barrett, J., Kamiński, B., Prałat, P., Théberge, F. (2024). Self-similarity of Communities of the ABCD Model. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-59205-8_2
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)