{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:23:04Z","timestamp":1775175784397,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_22","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:42:54Z","timestamp":1767314574000},"page":"302-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Expanders in\u00a0Models of\u00a0Social Networks"],"prefix":"10.1007","author":[{"given":"Marc","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[]},{"given":"Ulysse","family":"Schaller","sequence":"additional","affiliation":[]},{"given":"Konstantin","family":"Sturm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Fischbeck, P.: On the external validity of average-case analyses of graph algorithms. ACM Trans. Algorithms 20(1) (2024)","DOI":"10.1145\/3633778"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/nws.2022.32","volume":"10","author":"T Bl\u00e4sius","year":"2022","unstructured":"Bl\u00e4sius, T., Friedrich, T., Katzmann, M., Meyer, U., Penschuck, M., Weyand, C.: Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4), 361\u2013380 (2022)","journal-title":"Netw. Sci."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.08.014","volume":"760","author":"K Bringmann","year":"2019","unstructured":"Bringmann, K., Keusch, R., Lengler, J.: Geometric inhomogeneous random graphs. Theoret. Comput. Sci. 760, 35\u201354 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Keusch, R., Lengler, J.: Average distance in a general class of scale-free networks. Adv. Appl. Probab. 1\u201336 (2024)","DOI":"10.1017\/apr.2024.43"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jcss.2021.11.003","volume":"125","author":"K Bringmann","year":"2022","unstructured":"Bringmann, K., Keusch, R., Lengler, J., Maus, Y., Molla, A.R.: Greedy routing and the algorithmic small-world phenomenon. J. Comput. Syst. Sci. 125, 59\u2013105 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Gao, Y., Li, J., Nanongkai, D., Peng, R., Saranurak, T.: A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1158\u20131167 (2019)","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Dayan, B., Kaufmann, M., Schaller, U.: Expressivity of geometric inhomogeneous random graphs\u2014metric and non-metric. In: Botta, F., Macedo, M., Barbosa, H., Menezes, R. (eds) CompleNet-Live 2024. Springer Proceedings in Complexity, pp. 85\u2013100. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57515-0_7","DOI":"10.1007\/978-3-031-57515-0_7"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Deijfen, M., Van\u00a0der Hofstad, R., Hooghiemstra, G.: Scale-free percolation. In: Annales de l\u2019IHP Probabilit\u00e9s et statistiques, vol.\u00a049, pp. 817\u2013838 (2013)","DOI":"10.1214\/12-AIHP480"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-67810-8_5","volume-title":"Algorithms and Models for the Web Graph","author":"J Feldman","year":"2017","unstructured":"Feldman, J., Janssen, J.: High degree vertices and spread of infections in spatially modelled social networks. In: Bonato, A., Chung Graham, F., Pra\u0142at, P. (eds.) WAW 2017. LNCS, vol. 10519, pp. 60\u201374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67810-8_5"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks, pp. 1642\u20131660 (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.130","DOI":"10.1137\/1.9781611973099.130"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Lengler, J.: Nearly-tight analysis for 2-choice and 3-majority consensus dynamics. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, pp. 305\u2013313. Association for Computing Machinery, New York (2018)","DOI":"10.1145\/3212734.3212738"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter, M.S.: The strength of weak ties. Am. J. Sociol. 78(6), 1360\u20131380 (1973)","journal-title":"Am. J. Sociol."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439\u2013561 (2006)","journal-title":"Bull. Amer. Math. Soc."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"109965","DOI":"10.1016\/j.chaos.2020.109965","volume":"139","author":"J Jorritsma","year":"2020","unstructured":"Jorritsma, J., Hulshof, T., Komj\u00e1thy, J.: Not all interventions are equal for the height of the second peak. Chaos Solitons Fractals 139, 109965 (2020)","journal-title":"Chaos Solitons Fractals"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Jorritsma, J., Komj\u00e1thy, J., Mitsche, D.: Cluster-size decay in supercritical kernel-based spatial random graphs (2024). https:\/\/arxiv.org\/abs\/2303.00724","DOI":"10.1214\/24-EJP1135"},{"key":"22_CR16","unstructured":"Kaufmann, M., Lakis, K., Lengler, J., Ravi, R.R., Schaller, U., Sturm, K.: Rumour spreading depends on the latent geometry and degree distribution in social network models. arXiv preprint arXiv:2408.01268 (2024)"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Lengler, J., Schaller, U., Sturm, K.: Expanders in models of social networks. arXiv e-prints arXiv:2506.19485 (2025). https:\/\/doi.org\/10.48550\/arXiv.2506.19485","DOI":"10.48550\/arXiv.2506.19485"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Ravi, R.R., Schaller, U.: Sublinear cuts are the exception in BDF-GIRGs. In: The 13th International Conference on Complex Networks and their Applications (2024)","DOI":"10.1007\/978-3-031-82435-7_30"},{"key":"22_CR19","unstructured":"Koch, C., Lengler, J.: Bootstrap percolation on geometric inhomogeneous random graphs. Internet Math. 05c80 (2021)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/24-EJP1216","volume":"29","author":"J Komj\u00e1thy","year":"2024","unstructured":"Komj\u00e1thy, J., Lapinskas, J., Lengler, J., Schaller, U.: Polynomial growth in degree-dependent first passage percolation on spatial random graphs. Electron. J. Probab. 29, 1\u201348 (2024)","journal-title":"Electron. J. Probab."},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.spa.2019.04.014","volume":"130","author":"J Komj\u00e1thy","year":"2020","unstructured":"Komj\u00e1thy, J., Lodewijks, B.: Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs. Stochast. Process. Appl. 130(3), 1309\u20131367 (2020)","journal-title":"Stochast. Process. Appl."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Komj\u00e1thy, J., Lapinskas, J., Lengler, J., Schaller, U.: Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I (2024)","DOI":"10.1214\/24-EJP1216"},{"issue":"3","key":"22_CR23","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E-Stat. Nonlinear Soft Matt. Phys. 82(3), 036106 (2010)","journal-title":"Phys. Rev. E-Stat. Nonlinear Soft Matt. Phys."},{"key":"22_CR24","unstructured":"Lengler, J., Todorovic, L.: Existence of small separators depends on geometry for geometric inhomogeneous random graphs. arXiv preprint arXiv:1711.03814 (2017)"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Lubotzky, A.: Expander graphs in pure and applied mathematics. Bull. Am. Math. Soc. 49 (2011)","DOI":"10.1090\/S0273-0979-2011-01359-3"},{"key":"22_CR26","unstructured":"Racke, H.: Minimizing congestion in general networks. In: 2002 Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 43\u201352 (2002)"},{"issue":"4","key":"22_CR27","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/rsa.21224","volume":"65","author":"N Shimizu","year":"2024","unstructured":"Shimizu, N., Shiraga, T.: Quasi-majority functional voting on expander graphs. Random Struct. Algorithms 65(4), 613\u2013643 (2024)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"033034","DOI":"10.1103\/PhysRevResearch.1.033034","volume":"1","author":"I Voitalov","year":"2019","unstructured":"Voitalov, I., van der Hoorn, P., van der Hofstad, R., Krioukov, D.: Scale-free networks well done. Phys. Rev. Res. 1, 033034 (2019)","journal-title":"Phys. Rev. Res."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:42:56Z","timestamp":1767314576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}