1. Bloznelis, M., Leskelä, L.: Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorith. (2019). https://doi.org/10.1002/rsa.21140
2. Boguñá, M., Bonamassa, I., De Domenico, M., Havlin, S., Krioukov, D., Serrano, M.: Network geometry. Nat. Rev. Phys. 3(2), 114–135 (2021)
3. Bollobás, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1), 3–122 (2007). https://doi.org/10.1002/rsa.20168
4. Bringmann, K., Keusch, R., Lengler, J.: Average distance in a general class of scale-free networks with underlying geometry. (2016). arXiv:1602.05712
5. Bringmann, K., Keusch, R., Lengler, J.: Sampling geometric inhomogeneous random graphs in linear time. In 25th European Symposium on Algorithms, volume 87 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 20, 15. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2017)