{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:39:43Z","timestamp":1775054383789,"version":"3.50.1"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2017,10,7]],"date-time":"2017-10-07T00:00:00Z","timestamp":1507334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8,1]]},"DOI":"10.1093\/comnet\/cnx046","type":"journal-article","created":{"date-parts":[[2017,9,8]],"date-time":"2017-09-08T19:11:40Z","timestamp":1504897900000},"page":"596-619","source":"Crossref","is-referenced-by-count":14,"title":["Modularity of regular and treelike graphs"],"prefix":"10.1093","volume":"6","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[{"name":"Department of Statistics, University of Oxford, 24-29 St Giles, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fiona","family":"Skerman","sequence":"additional","affiliation":[{"name":"Heilbronn Institute for Mathematical Research, University of Bristol, Queen\u2019s Avenue, Bristol, UK and Department of Mathematics, \u00c5ngstr\u00f6mlaboratoriet, L\u00e4gerhyddsv\u00e4gen 1, 752 37 Uppsala, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"key\n\t\t\t\t20180810104614_B1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.physd.2006.09.009","article-title":"When are networks truly modular?","volume":"224","author":"Reichardt","year":"2006","journal-title":"Phys. D"},{"key":"key\n\t\t\t\t20180810104614_B2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: a user guide.","volume":"659","author":"Fortunato","year":"2016","journal-title":"Phys. Rep."},{"key":"key\n\t\t\t\t20180810104614_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":"key\n\t\t\t\t20180810104614_B4","doi-asserted-by":"crossref","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","article-title":"Statistical mechanics of community detection.","volume":"74","author":"Reichardt","year":"2006","journal-title":"Phys. Rev. E."},{"key":"key\n\t\t\t\t20180810104614_B5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","article-title":"On modularity clustering.","volume":"20","author":"Brandes","year":"2008","journal-title":"IEEE Trans Knowl. Data Eng.,"},{"key":"key\n\t\t\t\t20180810104614_B6","doi-asserted-by":"crossref","first-page":"066118","DOI":"10.1103\/PhysRevE.85.066118","article-title":"Communities and bottlenecks: trees and treelike networks have high modularity.","volume":"85","author":"Bagrow","year":"2012","journal-title":"Phys. Rev. E."},{"key":"key\n\t\t\t\t20180810104614_B7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-642-25591-5_45","article-title":"Asymptotic modularity of some graph classes.","volume-title":"Algorithms Comput.","author":"De Montgolfier","year":"2011"},{"key":"key\n\t\t\t\t20180810104614_B8","doi-asserted-by":"crossref","first-page":"025101","DOI":"10.1103\/PhysRevE.70.025101","article-title":"Modularity from fluctuations in random graphs and complex networks.","volume":"70","author":"Guimer\u00e0","year":"2004","journal-title":"Phys. Rev. E."},{"key":"key\n\t\t\t\t20180810104614_B9","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":"key\n\t\t\t\t20180810104614_B10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs.","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"key\n\t\t\t\t20180810104614_B11","first-page":"1082","article-title":"Communities in networks.","volume":"56","author":"Porter","year":"2009","journal-title":"Notices Amer. Math. Soc."},{"key":"key\n\t\t\t\t20180810104614_B12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.laa.2014.10.039","article-title":"Spectral properties of modularity matrices.","volume":"473","author":"Bolla","year":"2015","journal-title":"Linear Alg. Appl."},{"key":"key\n\t\t\t\t20180810104614_B13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.13001\/1081-3810.1921","article-title":"A note on graphs whose largest eigenvalues of the modularity matrix equals zero.","volume":"27","author":"Majstorovi\u0107","year":"2014","journal-title":"Electron. J. Linear Algebra"},{"key":"key\n\t\t\t\t20180810104614_B14","article-title":"Modularity of Erd\u0151s-R\u00e9nyi random graphs.","author":"McDiarmid","year":"2017"},{"key":"key\n\t\t\t\t20180810104614_B15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2012-20898-3","article-title":"Maximum modular graphs.","volume":"85","author":"Trajanovski","year":"2012","journal-title":"Eur. Phys. J. B"},{"key":"key\n\t\t\t\t20180810104614_B16","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.endm.2013.07.063","article-title":"Modularity in random regular graphs and lattices.","volume":"43","author":"McDiarmid","year":"2013","journal-title":"Electron. Notes Discrete Math."},{"key":"key\n\t\t\t\t20180810104614_B17","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":"10","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"key\n\t\t\t\t20180810104614_B18","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1093\/comjnl\/bxt002","article-title":"Fast multi-scale detection of relevant communities in large-scale networks.","volume":"56","author":"Le Martelot","year":"2013","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180810104614_B19","article-title":"Network modularity in the presence of covariates.","author":"Franke","year":"2016","journal-title":"preprint arXiv:1603.01214"},{"key":"key\n\t\t\t\t20180810104614_B20","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection.","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Proc. Natl. Acad. Sci. USA"},{"key":"key\n\t\t\t\t20180810104614_B21","volume-title":"Algorithm Design","author":"Kleinberg","year":"2005"},{"key":"key\n\t\t\t\t20180810104614_B22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial $k$-arboretum of graphs with bounded treewidth.","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"key\n\t\t\t\t20180810104614_B23","article-title":"Treewidth of graphs with balanced separations.","author":"Dvo\u0159\u00e1k","year":"2014","journal-title":"preprint arXiv:1408.3869"},{"key":"key\n\t\t\t\t20180810104614_B24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separator theorem for graphs of bounded genus.","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"key":"key\n\t\t\t\t20180810104614_B25","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1017\/S0963548308009097","article-title":"On the maximum degree of a random planar graph.","volume":"17","author":"McDiarmid","year":"2008","journal-title":"Combin. Probab. Comput."},{"key":"key\n\t\t\t\t20180810104614_B26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1017\/S0963548399003867","article-title":"Generating random regular graphs quickly.","volume":"8","author":"Steger","year":"1999","journal-title":"Combin. Probab. Comput."},{"key":"key\n\t\t\t\t20180810104614_B27","first-page":"2011","article-title":"A generalized louvain method for community detection implemented in MATLAB.","author":"Jeub","year":"2011"},{"key":"key\n\t\t\t\t20180810104614_B28","volume-title":"Random Graphs","author":"Janson","year":"2011"},{"key":"key\n\t\t\t\t20180810104614_B29","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1017\/S096354839700299X","article-title":"On the edge-expansion of graphs.","volume":"6","author":"Alon","year":"1997","journal-title":"Combin. Probab. Comput."},{"key":"key\n\t\t\t\t20180810104614_B30","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.tcs.2007.03.003","article-title":"Bounds on the bisection width for random $d$-regular graphs.","volume":"382","author":"D\u00edaz","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"key\n\t\t\t\t20180810104614_B31","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1214\/15-AOP1084","article-title":"Extremal cuts of sparse random graphs.","volume":"45","author":"Dembo","year":"2017","journal-title":"Ann. Probab."},{"key":"key\n\t\t\t\t20180810104614_B32","doi-asserted-by":"crossref","first-page":"056113","DOI":"10.1103\/PhysRevE.82.056113","article-title":"Spectral graph analysis of modularity and assortativity.","volume":"82","author":"Van Mieghem","year":"2010","journal-title":"Phys. Rev. E."},{"key":"key\n\t\t\t\t20180810104614_B33","article-title":"The probabilistic method.","author":"Alon","year":"2000","journal-title":"Wiley Ser. Discrete Math. Optim."},{"key":"key\n\t\t\t\t20180810104614_B34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-5060(08)70766-0","article-title":"Explicit construction of linear sized tolerant networks.","volume":"38","author":"Alon","year":"1988","journal-title":"Ann. Discrete Math."},{"key":"key\n\t\t\t\t20180810104614_B35","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/120891265","article-title":"Lower bounds for the isoperimetric numbers of random regular graphs.","volume":"28","author":"Kolesnikm","year":"2014","journal-title":"SIAM J. Discrete Math."},{"key":"key\n\t\t\t\t20180810104614_B36","author":"Skerman","year":"2016","journal-title":"Modularity of Networks"},{"issue":"910","key":"key\n\t\t\t\t20180810104614_B37","first-page":"viii","volume":"vol. 195,","author":"Friedman","year":"2008","journal-title":"A Proof of Alon\u2019s Second Eigenvalue Conjecture and Related Problems"},{"key":"key\n\t\t\t\t20180810104614_B38","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.jcss.2012.04.003","article-title":"On the complexity of Newman\u2019s community finding approach for biological and social networks.","volume":"79","author":"DasGupta","year":"2013","journal-title":"J. Comput. System Sci."},{"key":"key\n\t\t\t\t20180810104614_B39","article-title":"Modularity of lattices and other well-embeddable graphs.","author":"McDiarmid","year":"2017+","journal-title":"preprint"},{"key":"key\n\t\t\t\t20180810104614_B40","article-title":"Modularity of models of complex networks.","author":"Prokhorenkova","year":"2017","journal-title":"preprint arXiv:1701.03141"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/6\/4\/596\/25451962\/cnx046.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T07:56:26Z","timestamp":1570089386000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/6\/4\/596\/4372127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,7]]},"references-count":40,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,10,7]]},"published-print":{"date-parts":[[2018,8,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx046","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,8]]},"published":{"date-parts":[[2017,10,7]]}}}