{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:13:46Z","timestamp":1762272826882,"version":"3.41.2"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"vor","delay-in-days":10,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N5510129\/1"],"award-info":[{"award-number":["EP\/N5510129\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,20]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Modularity is a quantity which has been introduced in the context of complex networks in order to quantify how close a network is to an ideal modular network in which the nodes form small interconnected communities that are joined together with relatively few edges. In this article, we consider this quantity on a probabilistic model of complex networks introduced by Krioukov et al. (2010, Phys. Rev. E, 82, 036106). This model views a complex network as an expression of hidden popularity hierarchies (i.e. nodes higher up in the hierarchies have more global reach), encapsulated by an underlying hyperbolic space. For certain parameters, this model was proved to have typical features that are observed in complex networks such as power law degree distribution, bounded average degree, clustering coefficient that is asymptotically bounded away from zero and ultra-small typical distances. In the present work, we investigate its modularity and we show that, in this regime, it converges to one in probability.<\/jats:p>","DOI":"10.1093\/comnet\/cnab051","type":"journal-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T20:13:08Z","timestamp":1639599188000},"source":"Crossref","is-referenced-by-count":8,"title":["The modularity of random graphs on the hyperbolic plane"],"prefix":"10.1093","volume":"10","author":[{"given":"Jordan","family":"Chellig","sequence":"first","affiliation":[{"name":"School of Mathematics, University of Birmingham, B15 2TT, UK"}]},{"given":"Nikolaos","family":"Fountoulakis","sequence":"additional","affiliation":[{"name":"School of Mathematics, University of Birmingham, B15 2TT, UK"}]},{"given":"Fiona","family":"Skerman","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Uppsala University, Uppsala 75106, Sweden"}]}],"member":"286","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"key":"2021123013402503000_B1","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1086\/225469","article-title":"The strength of weak ties","volume":"78","author":"Granovetter,","year":"1973","journal-title":"Am. J. Sociol."},{"key":"2021123013402503000_B2","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2021123013402503000_B3","doi-asserted-by":"crossref","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","article-title":"Limits of modularity maximization in community detection","volume":"84","author":"Lancichinetti,","year":"2011","journal-title":"Phys. Rev. E"},{"key":"2021123013402503000_B4","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks","volume":"82","author":"Krioukov,","year":"2010","journal-title":"Phys. Rev. E"},{"key":"2021123013402503000_B5","first-page":"573","article-title":"Random hyperbolic graphs: degree sequence and clustering","author":"Gugelmann,","year":"2021","journal-title":"Proceedings of the 39th International Colloquium Conference on Automata, Languages, and Programming - Volume Part II"},{"key":"2021123013402503000_B6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert,","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"2021123013402503000_B7","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"Penrose,","year":"2003"},{"key":"2021123013402503000_B8","doi-asserted-by":"crossref","first-page":"295101","DOI":"10.1088\/1751-8121\/ab2269","article-title":"Scale-free network clustering in hyperbolic and other random graphs","volume":"52","author":"Stegehuis,","year":"2019","journal-title":"J. Phys. A Math. Theor."},{"key":"2021123013402503000_B9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/21-EJP583","article-title":"Clustering in a hyperbolic model of complex networks","volume":"26","author":"Fountoulakis,","year":"2021","journal-title":"Electron. J. Probab."},{"key":"2021123013402503000_B10","first-page":"P3","article-title":"On the largest component of a hyperbolic model of complex networks","volume":"22","author":"Bode,","year":"2015","journal-title":"Electron. J. Comb."},{"key":"2021123013402503000_B11","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1214\/17-AAP1314","article-title":"Law of large numbers in a hyperbolic model of complex networks","volume":"28","author":"Fountoulakis,","year":"2018","journal-title":"Ann. Appl. Probab."},{"key":"2021123013402503000_B12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/1.9781611973761.3","article-title":"A bound for the diameter of random hyperbolic graphs","author":"Kiwi,","year":"2015","journal-title":"Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA"},{"key":"2021123013402503000_B13","doi-asserted-by":"crossref","first-page":"2200","DOI":"10.1137\/18M121201X","article-title":"On the second largest component of random hyperbolic graphs","volume":"33","author":"Kiwi,","year":"2019","journal-title":"SIAM J. Discrete Math."},{"key":"2021123013402503000_B14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/rsa.20626","article-title":"The probability of connectivity in a hyperbolic model of complex networks","volume":"49","author":"Bode,","year":"2016","journal-title":"Random. Struct. Algor."},{"key":"2021123013402503000_B15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/20-EJP531","article-title":"Limit theory for isolated and extreme points in hyperbolic random geometric graphs","volume":"25","author":"Fountoulakis,","year":"2020","journal-title":"Electron. J. Probab."},{"key":"2021123013402503000_B16","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1137\/17M1123961","article-title":"On the diameter of hyperbolic random graphs","volume":"32","author":"Friedrich,","year":"2018","journal-title":"SIAM J. Discrete Math."},{"key":"2021123013402503000_B17","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1017\/apr.2019.23","article-title":"The diameter of KPKVB random graphs","volume":"51","author":"M\u00fcller,","year":"2019","journal-title":"Adv. Appl. Probab."},{"key":"2021123013402503000_B18","first-page":"1","article-title":"Typical distances in a geometric model for complex networks","volume":"1","author":"Abdullah,","year":"2017","journal-title":"Internet Math."},{"key":"2021123013402503000_B19","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman,","year":"2006","journal-title":"Phys. Rev. E"},{"key":"2021123013402503000_B20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-74839-7_12","article-title":"On finding graph clusterings with maximum modularity","author":"Brandes,","year":"2007","journal-title":"Proceedings of the 33rd International Workshop on Graph-theoretic Concepts in Computer Science"},{"key":"2021123013402503000_B21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/ICDM.2015.139","article-title":"Network clustering via maximizing modularity: approximation algorithms and theoretical limits","author":"Dinh,","year":"2015","journal-title":"2015 IEEE International Conference on Data Mining"},{"key":"2021123013402503000_B22","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman,","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021123013402503000_B23","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel,","year":"2008","journal-title":"J. Stat. Mech.: Theory Exp."},{"key":"2021123013402503000_B24","doi-asserted-by":"crossref","first-page":"e18209","DOI":"10.1371\/journal.pone.0018209","article-title":"Multilevel compression of random walks on networks reveals hierarchical organisation in large integrated systems","volume":"6","author":"Rosvall,","year":"2011","journal-title":"PLoS One"},{"key":"2021123013402503000_B25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","article-title":"Computing communities in large networks using random walks","volume":"10","author":"Pons,","year":"2006","journal-title":"J. Graph Algorithms Appl."},{"key":"2021123013402503000_B26","doi-asserted-by":"crossref","first-page":"36106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan,","year":"2007","journal-title":"Phys. Rev. E"},{"key":"2021123013402503000_B27","doi-asserted-by":"crossref","first-page":"e0169355","DOI":"10.1371\/journal.pone.0169355","article-title":"Locating structural centers: a density-based clustering method for community detection","volume":"12","author":"Wang,","year":"2017","journal-title":"PLoS One"},{"key":"2021123013402503000_B28","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/rsa.20910","article-title":"Modularity of Erd\u0151s\u2013R\u00e9nyi random graphs","volume":"57","author":"McDiarmid,","year":"2020","journal-title":"Random. Struct. Algor."},{"key":"2021123013402503000_B29","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1093\/comnet\/cnx046","article-title":"Modularity of regular and tree-like graphs","volume":"4","author":"McDiarmid,","year":"2018","journal-title":"J. Complex Netw."},{"key":"2021123013402503000_B30","first-page":"44","article-title":"On the modularity of 3-regular graphs and random graphs with given degree sequences","author":"Lichev,","year":"2020"},{"year":"2021","author":"Laso\u0144,","article-title":"Modularity of minor-free graphs. Combinatorics, Optimization and Algorithms for Telecommunications (211142); Institute of Mathematics of the Polish Academy of Sciences; Wroc\u0142aw University of Science and Technology","key":"2021123013402503000_B31"},{"key":"2021123013402503000_B32","doi-asserted-by":"crossref","first-page":"9421","DOI":"10.1038\/srep09421","article-title":"Emergence of soft communities from geometric preferential attachment","volume":"5","author":"Zuev,","year":"2015","journal-title":"Sci. Rep."},{"key":"2021123013402503000_B33","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1038\/nature11459","article-title":"Popularity versus similarity in growing networks","volume":"489","author":"Papadopoulos,","year":"2012","journal-title":"Nature"},{"key":"2021123013402503000_B34","doi-asserted-by":"crossref","first-page":"052002","DOI":"10.1088\/1367-2630\/aac06f","article-title":"A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities","volume":"20","author":"Muscoloni,","year":"2018","journal-title":"New J. Phys."},{"key":"2021123013402503000_B35","doi-asserted-by":"crossref","first-page":"063022","DOI":"10.1088\/1367-2630\/aac6f9","article-title":"Leveraging the nonuniform PSO network model as a benchmark for performance evaluation in community detection and link prediction","volume":"20","author":"Muscoloni,","year":"2018","journal-title":"New J. Phys."},{"key":"2021123013402503000_B36","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si,","year":"1999","journal-title":"Science"},{"key":"2021123013402503000_B37","first-page":"947","article-title":"Modularity in several random graph models. Electronic Notes in Discrete Mathematics","volume":"61","author":"Ostroumova Prokhorenkova,","year":"2017"},{"key":"2021123013402503000_B38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/15427951.2008.10129305","article-title":"A spatial web graph model with local influence regions","volume":"5","author":"Aiello,","year":"2009","journal-title":"Internet Math.,"},{"key":"2021123013402503000_B39","article-title":"Lectures on the Poisson Process","volume-title":"IMS Textbooks","author":"Last,","year":"2018"},{"key":"2021123013402503000_B40","first-page":"435","article-title":"Asymptotic modularity of some graph classes","volume-title":"Algorithms and Computation. ISAAC 2011","author":"de Montgolfier","year":"2011"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/1\/cnab051\/41987187\/cnab051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/1\/cnab051\/41987187\/cnab051.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T14:03:13Z","timestamp":1640872993000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnab051\/6490112"}},"subtitle":[],"editor":[{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,12,20]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12,20]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnab051","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2022,2,1]]},"published":{"date-parts":[[2021,12,20]]},"article-number":"cnab051"}}